English

The number of the non-full-rank Steiner triple systems

Combinatorics 2021-03-09 v3

Abstract

The pp-rank of a Steiner triple system BB is the dimension of the linear span of the set of characteristic vectors of blocks of BB, over GF(p)(p). We derive a formula for the number of different Steiner triple systems of order vv and given 22-rank r2r_2, r2<vr_2<v, and a formula for the number of Steiner triple systems of order vv and given 33-rank r3r_3, r3<v1r_3<v-1. Also, we prove that there are no Steiner triple systems of 22-rank smaller than vv and, at the same time, 33-rank smaller than v1v-1. Our results extend previous work on enumerating Steiner triple systems according to the rank of their codes, mainly by Tonchev, V.A.Zinoviev and D.V.Zinoviev for the binary case and by Jungnickel and Tonchev for the ternary case.

Keywords

Cite

@article{arxiv.1806.00009,
  title  = {The number of the non-full-rank Steiner triple systems},
  author = {Minjia Shi and Li Xu and Denis S. Krotov},
  journal= {arXiv preprint arXiv:1806.00009},
  year   = {2021}
}

Comments

V.3: revised, final. Introduction extended; table of known computational classifications included