Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms
Keywords:
Symmetric design, Linear code, Automorphism group, k-geodetic graphAbstract
We show that there are exactly 4285 symmetric (45,12,3) designs that admit nontrivial automorphisms. Among them there are 1161 self-dual designs and 1562 pairs of mutually dual designs. We describe the full automorphism groups of these designs and analyze their ternary codes. R. Mathon and E. Spence have constructed 1136 symmetric (45,12,3) designs with trivial automorphism group, which means that there are at least 5421 symmetric (45,12,3) designs. Further, we discuss trigeodetic graphs obtained from the symmetric $(45,12,3)$ designs. We prove that $k$-geodetic graphs constructed from mutually non-isomorphic designs are mutually non-isomorphic, hence there are at least 5421 mutually non-isomorphic trigeodetic graphs obtained from symmetric $(45,12,3)$ designs.
Downloads
References
R. W. Ahrens and G. Szekeres, On a combinatorial generalization of the 27 lines associated with a cubic surface, J. Austral. Math. Soc. 10(3-4) (1969) 485-492.
E. F. Assmus Jr. and J. D. Key, Designs and Their Codes, Cambridge Tracts in Mathematics 103, Cambridge University Press, Cambridge (1992).
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Second edition, Cambridge University Press, Cambridge (1999).
W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24(3-4) (1997) 235-265.
V. Ćepulić, On symmetric block designs $(45, 12, 3)$ with automorphisms of order 5, Ars Combin. 37 (1994) 33-48.
C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of Combinatorial Designs, Second edition, Chapman & Hall/CRC, Boca Raton, FL (2007).
K. Coolsaet, J. Degraer, and E. Spence, The strongly regular $(45, 12, 3, 3)$ graphs, Electron. J. Combin. 13(1) (2006) #R32.
D. Crnković, B. G. Rodrigues, S. Rukavina, and L. Simčić, Ternary codes from the strongly regular $(45, 12, 3, 3)$ graphs and orbit matrices of $2-(45, 12, 3)$ designs, Discrete Math. 312(20) (2012) 3000-3010.
D. Crnković and S. Rukavina, Construction of block designs admitting an abelian automorphism group, Metrika 62(2-3) (2005) 175-183.
D. Crnković and S. Rukavina, On some symmetric $(45, 12, 3)$ and $(40, 13, 4)$ designs, J. Comput. Math. Optim. 1(1) (2005) 55-63.
D. Crnković, S. Rukavina, and L. Simčić, On triplanes of order twelve admitting an automorphism of order six and their binary and ternary codes, Utilitas Math. 98 (2015) 357-377.
U. Dempwolff, Primitive rank 3 groups on symmetric designs, Des. Codes Cryptogr. 22(2) (2001) 191-207.
C. E. Frasser, $k$-geodetic graphs and their application to the topological design of computer networks, in Argentinian Workshop in Theoretical Computer Science, 28 JAIIO-WAIT'99 (1999) 187-203.
The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.7.2 (2013), http://www.gap-system.org.
M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Online table, http://www.codetables.de (accessed 2014-03-11).
Z. Janko, Coset enumeration in groups and constructions of symmetric designs, Ann. Discrete Math. 52 (1992) 275-277.
P. Kaski and P. R. J. Östergård, Classification Algorithms for Codes and Designs, Algorithms and Computation in Mathematics 15, Springer-Verlag, Berlin (2006).
P. Kaski and P. R. J. Östergård, There are exactly five biplanes with $k = 11$, J. Combin. Des. 16(2) (2008) 117-127.
T. Kölmel, Einbettbarkeit symmetrischer $(45, 12, 3)$ Blockplaene mit fixpunktfrei operierenden Automorphismen, Dissertation, Universität Heidelberg (1991).
C. W. H. Lam, G. Kolesova, and L. Thiel, A computer search for finite projective planes of order 9, Discrete Math. 92(1-3) (1991) 187-195.
E. S. Lander, Symmetric Designs: An Algebraic Approach, London Mathematical Society Lecture Note Series 74, Cambridge University Press, Cambridge (1983).
R. Mathon and A. Rosa, $2-(v, k, \lambda)$ designs of small order, in C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of Combinatorial Designs, Second edition, Chapman & Hall/CRC, Boca Raton, FL (2007) 25-58.
R. L. McFarland, A family of difference sets in non-cyclic groups, J. Combin. Theory Ser. A 15(1) (1973) 1-10.
V. Mandekić-Botteri, On symmetric block designs $(45, 12, 3)$ with involutory automorphism fixing 15 points, Glas. Mat. Ser. III 36(56)(2) (2001) 193-222.
R. Mathon and E. Spence, On $2-(45, 12, 3)$ designs, J. Combin. Des. 4(3) (1996) 155-175.
MinT, Dept. of Mathematics, University of Salzburg, The online database for optimal parameters of $(t, m, s)$-nets, $(t, s)$-sequences, orthogonal arrays, linear codes, and OOAs, http://mint.sbg.ac.at/index.php (accessed 2014-03-11).
R. M. Ramos, J. Sicilia, and M. T. Ramos, A generalization of geodetic graphs: $K$-geodetic graphs, Investigacion Operativa 6 (1998) 85-101.
L. D. Rudolph, A class of majority logic decodable codes, IEEE Trans. Inform. Theory 13(2) (1967) 305-307.
N. Srinivasan, J. Opatrný, and V. S. Alagar, Construction of geodetic and bigeodetic blocks of connectivity $k \ge 3$ and their relation to block designs, Ars Combin. 24 (1987) 101-114.
L. H. Soicher, DESIGN - a GAP package, Version 1.6 (2011), http://www.gap-system.org/Packages/design.html.
