{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:57Z","timestamp":1725537237205},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019593"},{"type":"electronic","value":"9783642019609"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01960-9_8","type":"book-chapter","created":{"date-parts":[[2009,9,12]],"date-time":"2009-09-12T11:33:11Z","timestamp":1252755191000},"page":"251-268","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmic Approach to Non-symmetric 3-class Association Schemes"],"prefix":"10.1007","author":[{"given":"Leif K.","family":"J\u00f8rgensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,13]]},"reference":[{"key":"8_CR1","volume-title":"Algebraic Combinatorics. I","author":"E. Bannai","year":"1984","unstructured":"E. Bannai and T. Ito, Algebraic Combinatorics. I, Benjamin-Cumming, Menlo Park, 1984."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/eujc.1993.1043","volume":"14","author":"E. Bannai","year":"1993","unstructured":"E. Bannai and S.-Y. Song, Character tables of fission schemes and fusion schemes, Europ. J. Combin., 14 (1993), 385\u2013396.","journal-title":"Europ. J. Combin."},{"key":"8_CR3","first-page":"667","volume-title":"The CRC Handbook of Combinatorial Designs","author":"A. E. Brouwer","year":"1996","unstructured":"A. E. Brouwer, Strongly regular graphs, in C. J. Colbourn and J. H. Dinitz (eds.) The CRC Handbook of Combinatorial Designs, pp. 667\u2013685, CRC Press, Boca Raton, 1996."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1008379409579","volume":"21","author":"F. C. Bussemaker","year":"2000","unstructured":"F. C. Bussemaker, W. Haemers, and E. Spence, The search for pseudo orthogonal Latin squares of order six, Designs Codes Cryptogr., 21 (2000), 77\u201382.","journal-title":"Designs Codes Cryptogr."},{"issue":"1","key":"8_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.37236\/1058","volume":"13","author":"K. Coolsaet","year":"2006","unstructured":"K. Coolsaet, J. Degraer, and E. Spence, The strongly regular (45,12,3,3) graphs, Electron. J. Combin. (1), 13 (2006), Research Paper 32, 9 pp.","journal-title":"Electron. J. Combin."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1018628204156","volume":"10","author":"E. R. Dam van","year":"1999","unstructured":"E. R. van Dam, Three-class association schemes, J. Algebraic Combin., 10 (1999), 69\u2013107.","journal-title":"J. Algebraic Combin."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0095-8956(87)90005-0","volume":"43","author":"H. Enomoto","year":"1987","unstructured":"H. Enomoto and R. A. Mena, Distance-regular digraphs of girth 4, J. Combin. Theory, Ser. B, 43 (1987), 293\u2013302.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"8_CR8","series-title":"Colloq. Internat. CNRS","first-page":"131","volume-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes","author":"I. A. Farad\u017eev","year":"1978","unstructured":"I. A. Farad\u017eev, Constructive enumeration of combinatorial objects, in Probl\u00e8mes combinatoires et th\u00e9orie des graphes. Colloq. Internat. CNRS, Vol. 260, pp. 131\u2013135, CNRS, Paris, 1978."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-94-017-1972-8","volume-title":"Investigations in Algebraic Theory of Combinatorial Objects","author":"I. A. Farad\u017eev","year":"1994","unstructured":"I. A. Farad\u017eev, M. H. Klin, and M. E. Muzichuk, Cellular rings and groups of automorphisms of graphs, in I. A. Farad\u017eev, A. A. Ivanov, M. H. Klin, and A.\u00a0J.\u00a0Woldar (eds.) Investigations in Algebraic Theory of Combinatorial Objects, pp. 1\u2013152, Kluwer Academic, Dordrecht, 1994."},{"key":"8_CR10","unstructured":"The GAP Group, GAP \u2013 Groups, Algorithms, and Programming, Version 4.4.9; 2006, http:\/\/www.gap-system.org ."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1006\/eujc.1994.1053","volume":"15","author":"R. W. Goldbach","year":"1994","unstructured":"R. W. Goldbach and H. L. Claasen, A primitive non-symmetric 3-class association scheme on 36 elements with p 11 1 =0 exists and is unique, Europ. J. Combin., 15 (1994), 519\u2013524.","journal-title":"Europ. J. Combin."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0019-3577(94)90004-3","volume":"5","author":"R. W. Goldbach","year":"1994","unstructured":"R. W. Goldbach and H. L. Claasen, On splitting the Clebsch graph, Indag. Math. (N.S.), 5 (1994), 285\u2013290.","journal-title":"Indag. Math. (N.S.)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(96)00103-3","volume":"159","author":"R. W. Goldbach","year":"1996","unstructured":"R. W. Goldbach and H. L. Claasen, Feasibility conditions for non-symmetric 3-class association schemes, Discrete Math., 159 (1996), 111\u2013118.","journal-title":"Discrete Math."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/eujc.1996.0003","volume":"17","author":"R. W. Goldbach","year":"1996","unstructured":"R. W. Goldbach and H. L. Claasen, The structure of imprimitive non-symmetric 3-class association schemes, Europ. J. Combin., 17 (1996), 23\u201337.","journal-title":"Europ. J. Combin."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00147398","volume":"4","author":"D. G. Higman","year":"1975","unstructured":"D. G. Higman, Coherent configurations, Geom. Dedicata, 4 (1975), 1\u201332.","journal-title":"Geom. Dedicata"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"4","author":"A. J. Hoffman","year":"1960","unstructured":"A. J. Hoffman and R. R. Singleton, On Moore graphs with diameters 2 and 3, IBM J. Res. Develop., 4 (1960), 497\u2013504.","journal-title":"IBM J. Res. Develop."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0097-3165(02)00015-8","volume":"101","author":"Y. J. Ionin","year":"2003","unstructured":"Y. J. Ionin and H. Kharaghani, Doubly regular digraphs and symmetric designs, J. Combin. Theory, Ser. A, 101 (2003), 35\u201348.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(88)90208-7","volume":"72","author":"N. Ito","year":"1988","unstructured":"N. Ito, Doubly regular asymmetric digraphs, Discrete Math., 72 (1988), 181\u2013185.","journal-title":"Discrete Math."},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1515\/9783110848397-011","volume-title":"Group Theory","author":"N. Ito","year":"1989","unstructured":"N. Ito, Automorphism groups of DRADs, in Group Theory, Singapore, 1987, pp. 151\u2013170, de Gruyter, Berlin, 1989."},{"key":"8_CR20","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BFb0086244","volume-title":"Groups\u2013Korea 1988","author":"N. Ito","year":"1989","unstructured":"N. Ito, Doubly regular asymmetric digraphs with rank 5 automorphism groups, in Groups\u2013Korea 1988. Lecture Notes in Math., Vol. 1398, pp. 94\u201399, Springer, Berlin, 1989."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01788675","volume":"5","author":"N. Ito","year":"1989","unstructured":"N. Ito, On spectra of doubly regular asymmetric digraphs of RH-type, Graphs Combin., 5 (1989), 229\u2013234.","journal-title":"Graphs Combin."},{"key":"8_CR22","unstructured":"A. A. Ivanov, M. H. Klin, and I. A. Farad\u017eev, The Primitive Representations of the Non-abelian Simple Groups of Order less than 106 . Part 2 (Russian), Preprint, Moscow, Institute for System Studies, 1984, 76 pp."},{"key":"8_CR23","doi-asserted-by":"crossref","first-page":"231","DOI":"10.14492\/hokmj\/1381758983","volume":"2","author":"S. Iwasaki","year":"1973","unstructured":"S. Iwasaki, A characterization of PSU(3,32) as a permutation group of rank 4, Hokkaido Math. J., 2 (1973), 231\u2013235.","journal-title":"Hokkaido Math. J."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jcta.2000.3166","volume":"95","author":"Z. Janko","year":"2001","unstructured":"Z. Janko, The existence of a Bush-type Hadamard matrix of order 36 and two new infinite classes of symmetric designs, J. Combin. Theory, Ser. A, 95 (2001), 360\u2013364.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"8_CR25","unstructured":"L. K. J\u00f8rgensen, Normally regular digraphs, preprint R-94-2023, Institute for Electronic Systems, Aalborg University, 1994, 44 pp."},{"key":"8_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.37236\/1710","volume":"10","author":"L. K. J\u00f8rgensen","year":"2003","unstructured":"L. K. J\u00f8rgensen and M. H. Klin, Switching of edges in strongly regular graphs. I. A family of partial difference sets on 100 vertices, Electron. J. Combin., 10 (2003), Research Paper 17, 31 pp.","journal-title":"Electron. J. Combin."},{"key":"8_CR27","unstructured":"L. K. J\u00f8rgensen, G. A. Jones, M. H. Klin, and S. Y. Song, Normally Regular Digraphs, Association Schemes and Related Combinatorial Structures (in preparation)."},{"key":"8_CR28","unstructured":"L. K. J\u00f8rgensen, Schur Rings and Non-symmetric Association Schemes on 64 Vertices, Preprint R-2008-17, Department of Mathematical Sciences, Aalborg University, 2008, 16 pp."},{"key":"8_CR29","first-page":"11","volume":"7","author":"H. Kharaghani","year":"2000","unstructured":"H. Kharaghani, On the twin designs with the Ionin-type parameters, Electron. J. Combin., 7 (2000), Research Paper 1, 11 pp.","journal-title":"Electron. J. Combin."},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0097-3165(88)90045-3","volume":"47","author":"R. A. Liebler","year":"1988","unstructured":"R. A. Liebler and R. A. Mena, Certain Distance regular digraphs and related rings of characteristic 4, J. Combin. Theory, Ser. B, 47 (1988), 111\u2013123.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"8_CR31","unstructured":"B. D. McKay, Nauty User\u2019s Guide (Version 1.5), Technical report TR-CS-90-02, Australian National University, Computer Science Department, 1990."},{"key":"8_CR32","first-page":"293","volume":"24","author":"B. D. McKay","year":"2001","unstructured":"B. D. McKay and E. Spence, Classification of regular two-graphs on 36 and 38 vertices, Australas. J. Combin., 24 (2001), 293\u2013300.","journal-title":"Australas. J. Combin."},{"key":"8_CR33","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BFb0092282","volume-title":"Combinatorics and Graph Theory","author":"A. Neumaier","year":"1981","unstructured":"A. Neumaier, New inequalities for the parameters of an association scheme, in Combinatorics and Graph Theory, Calcutta, 1980. Lecture Notes in Math., Vol. 885, pp. 365\u2013367, Springer, Berlin, 1981."},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R. C. Read","year":"1978","unstructured":"R. C. Read, Every one a winner or How to avoid isomorphism search when cataloguing combinatorial configurations, Ann. Discrete Math., 2 (1978), 107\u2013120.","journal-title":"Ann. Discrete Math."},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0097-3165(72)90098-2","volume":"12","author":"K. B. Reid","year":"1972","unstructured":"K. B. Reid and E. Brown, Doubly regular tournaments are equivalent to skew Hadamard matrices, J. Combin. Theory, Ser. A, 12 (1972), 332\u2013338.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"8_CR36","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1090\/dimacs\/011\/20","volume-title":"Groups and Computation","author":"L. H. Soicher","year":"1993","unstructured":"L. H. Soicher, GRAPE: a system for computing with graphs and groups, in L. Finkelstein and W. M. Kantor (eds.) Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 11, pp.\u00a0287\u2013291, AMS, Providence, 1993."},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(95)90077-2","volume":"70","author":"S.-Y. Song","year":"1995","unstructured":"S.-Y. Song, Class 3 association schemes whose symmetrization have two classes, J. Combin. Theory, Ser. A, 70 (1995), 1\u201329.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"8_CR38","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/1385-7258(83)90047-1","volume":"45","author":"H. A. Wilbrink","year":"1983","unstructured":"H. A. Wilbrink and A. E. Brouwer, A (57,14,1) strongly regular graph does not exist, Indag. Math., 45 (1983), 117\u2013121.","journal-title":"Indag. Math."}],"container-title":["Algorithmic Algebraic Combinatorics and Gr\u00f6bner Bases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01960-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:22:12Z","timestamp":1606184532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01960-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019593","9783642019609"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01960-9_8","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}