Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

European Journal of Combinatorics

Volumn 28, Issue 7 SPEC. ISS., 2007, Pages 1994-2025

  Klin, M ^a   Muzychuk, M ^b   Pech, C ^c   Woldar, A ^d   Zieschang, P H ^e  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b NETANYA ACADEMIC COLLEGE   (Israel)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^d VILLANOVA UNIVERSITY   (United States)

^e UNIVERSITY OF TEXAS AT BROWNSVILLE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34447109264     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.08.010     Document Type: Article

References (44)

1. Aigner M. Combinatorial Theory (1979), Springer, Berlin
2. Bang S., and Hirasaka M. Construction of association schemes from difference sets. European J. Combin. 26 (2005) 59-74
3. Bannai E., and Ito T. Algebraic Combinatorics I. Association Schemes (1984), Benjamin/Cummings, Menlo Park
4. Bose R.C., and Mesner D.M. On linear associative algebras corresponding to association schemes of partially balanced designs. Ann. Math. Stat. 30 1 (1959) 21-38
5. Brouwer A.E., Cohen A.M., and Neumaier A. Distance Regular Graphs (1989), Springer, Berlin
6. Chang L.C. The uniqueness and non-uniqueness of the triangular association scheme. Sci. Record Peking Math. (New Series) 3 (1959) 604-613
7. 2 = 4. Sci. Record Peking Math. (New Series) 4 (1960) 12-18
8. Connor Jr. W.S. The uniqueness of the triangular association scheme. Ann. Math. Stat. 29 (1958) 262-266
9. van Dam E. Three-class association schemes. J. Algebraic Combin. 10 (1999) 69-107
10. Evdokimov S., and Ponomarenko I. Two inequalities for the parameters of cellular algebra. Zap. Nauchn. Sem. (POMI) 240 (1997) 82-95 (in Russian)
11. Evdokimov S., and Ponomarenko I. On highly closed cellular algebras and highly closed isomorphisms. Electron. J. Combin. 6 1 (1999) R18
12. Faradžev I.A., and Klin M.H. Computer package for computations with coherent configurations. Proc. ISSAC-91 (1991), ACM Press, Bonn 219-223
13. 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
14. F. Fiedler, Enumeration of cellular algebras applied to graphs with prescribed symmetry, Diplomarbeit, Technische Univerität Dresden, Institüt für Algebra, Dresden, 1998
15. Fon-Der-Flaass D.G. New prolific constructions of strongly regular graphs. Adv. Geom. 2 3 (2002) 301-306
16. C. Godsil, Association Schemes, Notes. http://quoll.uwaterloo.ca/pstuff/assoc.pdf
17. W.H. Haemers, V.D. Tonchev, Spreads in strongly regular graphs, Des. Codes Cryptogr. 8, 145-157
18. Hanaki A., and Miyamoto I. Classification of association schemes of small order. Online catalogue. http://kissme.shinshu-u.ac.jp/as
19. Higman D.G. Coherent configurations. I. Rend. Sem. Mat. Univ. Padova 44 (1970) 1-25
20. Higman D.G. Coherent configurations. Part I: Ordinal representation theory. Geom. Dedicata 4 (1975) 1-32
21. Hirasaka M., and Muzychuk M. Association schemes generated by a non-symmetric relation of valency 2. Discrete Math. 244 (2002) 109-135
22. Hirasaka M., and Muzychuk M. On quasithin association schemes. J. Combin. Theory Ser. A 98 (2002) 17-32
23. Hoffman A.J. On the uniqueness of the triangular association scheme. Ann. Math. Stat. 31 (1960) 492-497
24. H.D.L. Hollmann, Association Schemes, Master's Thesis, Eindhoven Univ. of Technology, 1982
25. Hollmann H. Pseudocyclic 3-class association schemes on 28 points. Discrete Math. 52 (1984) 209-224
26. m). J. Combin. Theory Ser. A 113 (2006) 1008-1018
27. Klin M.H., Meszka M., Reichard S., and Rosa A. The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition. Bayreuth. Math. Schr. 74 (2005) 145-205
28. M.H. Klin, M. Muzychuk, S. Reichard, Wallis-Fon-Der-Flaass coherent configurations on 16 points and related combinatorial structures (in preparation)
29. Klin M.H., Pöschel R., and Rosenbaum K. Angewandte Algebra (1988), Vieweg, Braunschweig
30. M. Klin, S. Reichard, A. Woldar, On a simple group of order 504, its automorphism group, and related combinatorial structures (in preparation)
31. Mathon R. 3-class association schemes. Proc. Conf. Alg. Aspects Comb., Sem. Toronto. Congressus Numer. vol. 13 (1975) 123-155
32. B.D. McKay, Nauty User's Guide (Version 1.5), Technical Report TR-CS-90-02, Computer Science Department, Australian National University, 1990
33. D.M. Mesner, An investigation of certain combinatorial properties of partially balanced incomplete block experimental designs and association schemes, with a detailed study of designs of Latin square and related types, Ph.D. Thesis, Michigan State University, Department of Statistics, 1956
34. Miyamoto I. Computing isomorphisms of association schemes and its applications. J. Symbolic Comput. 32 (2001) 133-141
35. M. Muzychuk, On half-homogeneous coherent configurations (manuscript)
36. M. Muzychuk, A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs, J. Algebraic Combin. (in press)
37. Schönert M., et al. GAP - groups, algorithms, and programming. Lehrstuhl D für Mathematik. fifth ed. (1995), Rheinisch-Westfälische Technische Hochschule, Aachen, Germany
38. J.J. Seidel, A. Blokhuis, H.A. Wilbrink, Graphs and association schemes, algebra and geometry, Dept. Math. & Comp. Sci., Eindhoven Univ. of Technology, Netherlands, EUT Report 83-WSK-02, May 1983, Notes prepared by J.P. Boly, C.P.H. van Hoesel
39. 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 vol. 11 (1993), AMS 287-291
40. Wallis W.D. Construction of strongly regular graphs using affine designs. Bull. Austral. Math. Soc. 4 (1971) 41-49
41. In: Weisfeiler B. (Ed). On Construction and Identification of Graphs. Lect. Notes Math. vol. 558 (1976), Springer, Berlin
42. Wielandt H. Finite Permutation Groups (1964), Academic Press, NY
43. H. Wielandt, Permutation groups through invariant relations and invariant functions, in: Lecture Notes, Ohio State University, 1969
44. Zieschang P.-H. An Algebraic Approach to Association Schemes. Lect. Notes Math. vol. 1628 (1996), Springer, Berlin