Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms

Authors

  • Dean Crnković
  • Doris Dumičić Danilović
  • Sanja Rukavina

Keywords:

Symmetric design, Linear code, Automorphism group, k-geodetic graph

Abstract

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

Download data is not yet available.

Downloads

Published

2016-09-15

How to Cite

Crnković, D., Danilović, D. D. ., & Rukavina, S. (2016). Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms. Journal of Algebra Combinatorics Discrete Structures and Applications, 3(3), 145–154. Retrieved from https://jacodesmath.com/index.php/jacodesmath/article/view/42

Issue

Section

Articles