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

From MaRDI portal
Publication:5204968

DOI10.1002/JCD.21663zbMATH Open1427.05041arXiv1806.00009OpenAlexW3103931004WikidataQ127409495 ScholiaQ127409495MaRDI QIDQ5204968FDOQ5204968


Authors: Minjia Shi, Li Xu, Denis S. Krotov Edit this on Wikidata


Publication date: 10 December 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Abstract: The p-rank of a Steiner triple system B is the dimension of the linear span of the set of characteristic vectors of blocks of B, over GF(p). We derive a formula for the number of different Steiner triple systems of order v and given 2-rank r2, r2<v, and a formula for the number of Steiner triple systems of order v and given 3-rank r3, r3<v1. Also, we prove that there are no Steiner triple systems of 2-rank smaller than v and, at the same time, 3-rank smaller than v1. 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.


Full work available at URL: https://arxiv.org/abs/1806.00009




Recommendations





Cited In (10)





This page was built for publication: The number of the non-full-rank Steiner triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204968)