Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach

Electronic Notes in Discrete Mathematics

Volumn 23, Issue , 2005, Pages 13-21

  Heinze, Aiso ^a   Klin, Mikhail ^b  

^a UNIVERSITY OF AUGSBURG   (Germany)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247149855     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.103     Document Type: Article

References (19)

1. Babai L. Automorphism groups, isomorphism, reconstruction. Handbook of combinatorics Vol. 1, 2 (1995), Elsevier, Amsterdam 1447-1540
2. Barlotti A., and Strambach K. The geometry of binary systems. Advances in Mathematics 49 (1983) 1-105
3. van Dam, E., M. Klin, M. Muzychuk, and A. Woldar, Some implications on amorphic association schemes, in preparation
4. Denes J., and Keedwell A.D. Latin squares and their applications (1974), Academic Press, New York-London
5. Faradžev I.A., Ivanov A.A., and Klin M.H. Galois correspondence between permutation groups and cellular rings (association schemes). Graphs and Combinatorics 6 (1990) 303-332
6. Faradžev I.A., and Klin M.H. Computer package for computations with coherent configurations. Proc. ISSAC-91 (1991), ACM Press, Bonn 219-223
7. Faradžev I.A., Klin M.H., and Muzichuk M.E. Cellular rings and groups of automorphisms of graphs. In: Faradžev I.A., Ivanov A.A., Klin M.H., and Woldar A.J. (Eds). Investigations in algebraic theory of combinatorial objects (1994), Kluwer Acad. Publ., Dordrecht 1-152
8. Gol'fand Ja.Ju., Ivanov A.V., and Klin M.H. Amorphic cellular rings. I, II. (Russian). Investigations in Algebraic Theory of Combinatorial Objects (1985), Institute for System Studies, Moscow 32-38 39-49. (English translation
9. Gol'fand Ja.Ju., Ivanov A.V., and Klin M.H. Amorphic cellular rings. I, II. (Russian). In: Faradžev I.A., et al. (Ed). Investigations in Algebraic Theory of Combinatorial Objects (1994), Kluwer Acad. Publ., Dordrecht 167-187
10. Jorgensen L.K., and Klin M. 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. (electronic)
11. Heinze, A., "Application of Schur rings in algebraic combinatorics: graphs, partial difference sets and cyclotomic schemes," Ph.D. Thesis. Fachbereich Mathematik der Carl von Ossietzky Universität Oldenburg, 2001
12. McKay, B.D., "nauty User's Guide (Version 1.5)" Computer Science Department, 1990, TR-CS-90-02, Australian National University
13. McKay, B.D., A. Meynert, and W. Myrvold, Small Latin squares, quasigroups and loops, Preprint, 2004
14. Moorhouse G.E. Bruck nets, codes, and characters of loops. Des. Codes Cryptogr. 1 (1991) 7-29
15. Pflugfelder H.O. Quasigroups and loops: Introduction. Sigma Series in Pure Mathematics 7 (1990), Heldermann Verlag, Berlin
16. Schönert M., et al. GAP - Groups, Algorithms, and Programming. Lehrstuhl D für Mathematik. fifth edition (1995), Rheinisch-Westfälische Technische Hochschule, Aachen, Germany
17. Soicher L.H. GRAPE: a system for computing with graphs and groups. In: Finkelstein L., and Kantor W.M. (Eds). Groups and Computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science volume 11 (1993), A.M.S. 287-291
18. Spence E. Homepage, URL. http://www.maths.gla.ac.uk/~es/srgraphs.html
19. Sprague A.P. Translation nets. Mitt. Math. Sem. Giessen 157 (1982) 46-68