×

Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. (English) Zbl 1145.05056

The key contribution of this article, as intended by the authors, is providing a unified explanation of various association schemes on \(28\) points. They are all thought of as mergings of one specific coherent configuration, a rank 112 coherent configuration on \(28\) points with \(7\) fibers of size \(4\) arising from the regular action of \(Z_2^3\) on the set of \(2\)-element subsets of an \(8\)-element set. This configuration is constructed and inspected from various sides, with a whole section devoted to its automorphism groups.
Various association schemes, including those of pseudocyclic, quasithin, and pseudotriangular types, are then shown to be the results of mergings which arise from suitable subgroups of the group of algebraic automorphisms of the main configuration. Particular attention is paid to the curious concept of algebraic twins, special pairs of equivalence classes, some of which contain both Schurian and non-Schurian fusions.
Although the article contains a wealth of data and includes several pages of computer output, the reader may occasionally feel that some of the concepts have not been given enough space, as if the article was created by leaving out parts from a larger, more detailed text.

MSC:

05E30 Association schemes, strongly regular graphs

Software:

GAP; nauty; GRAPE
Full Text: DOI

References:

[1] Aigner, M., Combinatorial Theory (1979), Springer: Springer Berlin · Zbl 0415.05001
[2] Bang, S.; Hirasaka, M., Construction of association schemes from difference sets, European J. Combin., 26, 59-74 (2005) · Zbl 1054.05100
[3] Bannai, E.; Ito, T., Algebraic Combinatorics I. Association Schemes (1984), Benjamin/Cummings: Benjamin/Cummings Menlo Park · Zbl 0555.05019
[4] Bose, R. C.; Mesner, D. M., On linear associative algebras corresponding to association schemes of partially balanced designs, Ann. Math. Stat., 30, 1, 21-38 (1959) · Zbl 0089.15002
[5] Brouwer, A. E.; Cohen, A. M.; Neumaier, A., Distance Regular Graphs (1989), Springer: Springer Berlin · Zbl 0747.05073
[6] Chang, L. C., The uniqueness and non-uniqueness of the triangular association scheme, Sci. Record Peking Math. (New Series), 3, 604-613 (1959) · Zbl 0089.15102
[7] Chang, L. C., Association schemes of partially balanced block designs with parameters \(\nu = 28, n_1 = 12, n_2 = 15\) and \(p_{11}^2 = 4\), Sci. Record Peking Math. (New Series), 4, 12-18 (1960) · Zbl 0093.32101
[8] Connor, W. S., The uniqueness of the triangular association scheme, Ann. Math. Stat., 29, 262-266 (1958) · Zbl 0085.35601
[9] van Dam, E., Three-class association schemes, J. Algebraic Combin., 10, 69-107 (1999) · Zbl 0929.05096
[10] Evdokimov, S.; Ponomarenko, I., Two inequalities for the parameters of cellular algebra, Zap. Nauchn. Sem. (POMI), 240, 82-95 (1997), (in Russian)
[11] Evdokimov, S.; Ponomarenko, I., On highly closed cellular algebras and highly closed isomorphisms, Electron. J. Combin., 6, 1, R18 (1999) · Zbl 0911.05061
[12] Faradžev, I. A.; Klin, M. H., Computer package for computations with coherent configurations, (Proc. ISSAC-91 (1991), ACM Press: ACM Press Bonn), 219-223 · Zbl 0925.20006
[13] Faradžev, I. A.; Klin, M. H.; Muzichuk, M. E., Cellular rings and groups of automorphisms of graphs, (Faradžev, I. A.; Ivanov, A. A.; Klin, M. H.; Woldar, A. J., Investigations in Algebraic Theory of Combinatorial Objects (1994), Kluwer Acad. Publ.: Kluwer Acad. Publ. Dordrecht), 1-152 · Zbl 0795.05073
[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; 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, 301-306 (2002) · Zbl 1012.05158
[16] C. Godsil, Association Schemes, Notes. http://quoll.uwaterloo.ca/pstuff/assoc.pdf; 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; W.H. Haemers, V.D. Tonchev, Spreads in strongly regular graphs, Des. Codes Cryptogr. 8, 145-157 · Zbl 0870.05078
[18] Hanaki, A.; Miyamoto, I., Classification of association schemes of small order, Online catalogue. · Zbl 1014.05073
[19] Higman, D. G., Coherent configurations, I. Rend. Sem. Mat. Univ. Padova, 44, 1-25 (1970) · Zbl 0279.05025
[20] Higman, D. G., Coherent configurations. Part I: Ordinal representation theory, Geom. Dedicata, 4, 1-32 (1975) · Zbl 0333.05010
[21] Hirasaka, M.; Muzychuk, M., Association schemes generated by a non-symmetric relation of valency 2, Discrete Math., 244, 109-135 (2002) · Zbl 0998.05030
[22] Hirasaka, M.; Muzychuk, M., On quasithin association schemes, J. Combin. Theory Ser. A, 98, 17-32 (2002) · Zbl 0994.05149
[23] Hoffman, A. J., On the uniqueness of the triangular association scheme, Ann. Math. Stat., 31, 492-497 (1960) · Zbl 0091.31504
[24] H.D.L. Hollmann, Association Schemes, Master’s Thesis, Eindhoven Univ. of Technology, 1982; 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, 209-224 (1984) · Zbl 0559.05019
[26] Hollmann, H.; Xiang, Q., Pseudocyclic association schemes arising from the actions of \(P G L(2, 2^m)\) and \(P \Gamma L(2, 2^m)\), J. Combin. Theory Ser. A, 113, 1008-1018 (2006) · Zbl 1094.05058
[27] Klin, M. H.; Meszka, M.; Reichard, S.; Rosa, A., The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition, Bayreuth. Math. Schr., 74, 145-205 (2005) · Zbl 1100.05102
[28] M.H. Klin, M. Muzychuk, S. Reichard, Wallis-Fon-Der-Flaass coherent configurations on 16 points and related combinatorial structures (in preparation); 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.; Rosenbaum, K., Angewandte Algebra (1988), Vieweg: Vieweg Braunschweig · Zbl 0648.20001
[30] M. Klin, S. Reichard, A. Woldar, On a simple group of order 504, its automorphism group, and related combinatorial structures (in preparation); M. Klin, S. Reichard, A. Woldar, On a simple group of order 504, its automorphism group, and related combinatorial structures (in preparation) · Zbl 1200.05084
[31] Mathon, R., 3-class association schemes, (Proc. Conf. Alg. Aspects Comb., Sem. Toronto. Proc. Conf. Alg. Aspects Comb., Sem. Toronto, Congressus Numer., vol. 13 (1975)), 123-155 · Zbl 0326.05023
[32] B.D. McKay, Nauty; B.D. McKay, Nauty
[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; 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, 133-141 (2001) · Zbl 1044.05071
[35] M. Muzychuk, On half-homogeneous coherent configurations (manuscript); 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); M. Muzychuk, A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs, J. Algebraic Combin. (in press) · Zbl 1111.05101
[37] Schönert, M., GAP — groups, algorithms, and programming, (Lehrstuhl D für Mathematik (1995), Rheinisch-Westfälische Technische Hochschule: 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; 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 · Zbl 0511.05001
[39] Soicher, L. H., GRAPE: A system for computing with graphs and groups, (Finkelstein, L.; Kantor, W. M., Groups and Computation. Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11 (1993), AMS), 287-291 · Zbl 0833.05071
[40] Wallis, W. D., Construction of strongly regular graphs using affine designs, Bull. Austral. Math. Soc., 4, 41-49 (1971) · Zbl 0203.30802
[41] (Weisfeiler, B., On Construction and Identification of Graphs. On Construction and Identification of Graphs, Lect. Notes Math., vol. 558 (1976), Springer: Springer Berlin) · Zbl 0366.05019
[42] Wielandt, H., Finite Permutation Groups (1964), Academic Press: Academic Press NY · Zbl 0138.02501
[43] H. Wielandt, Permutation groups through invariant relations and invariant functions, in: Lecture Notes, Ohio State University, 1969; 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. An Algebraic Approach to Association Schemes, Lect. Notes Math., vol. 1628 (1996), Springer: Springer Berlin) · Zbl 0857.05100
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.