The number of the non-full-rank Steiner triple systems
Abstract
The -rank of a Steiner triple system is the dimension of the linear span of the set of characteristic vectors of blocks of , over GF. We derive a formula for the number of different Steiner triple systems of order and given -rank , , and a formula for the number of Steiner triple systems of order and given -rank , . Also, we prove that there are no Steiner triple systems of -rank smaller than and, at the same time, -rank smaller than . 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