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

DOI10.1002/JCD.21663MaRDI QIDQ5204968zbMATH OpenOpenAlexWikidataFDO

Authors Minjia Shi, Li Xu, Denis S. Krotov

Publication date 10 December 2019

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

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

zbMATH Keywords

3-rank2-rankSteiner triple system

Mathematics Subject Classification ID

Triple systems (05B07)

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 $r_2$, $r_2<v$, and a formula for the number of Steiner triple systems of order $v$ and given $3$-rank $r_3$, $r_3<v-1$. 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 $v-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.

Recommendations

• Counting Steiner triple systems with classical parameters and prescribed rank
• A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
• The number of the non-full-rank Steiner quadruple systems \(S ( v , 4 , 3 )\)
• There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27
• On classifying Steiner triple systems by their 3-rank

Cited in

(10)

• A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
• Counting Steiner triple systems with classical parameters and prescribed rank
• scientific article; zbMATH DE number 1228449 (Why is no real title available?)
• On classifying Steiner triple systems by their 3-rank
• On the number of resolvable Steiner triple systems of small 3-rank
• The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\)
• Infinite families of 2‐designs derived from affine‐invariant codes
• The number of the non-full-rank Steiner quadruple systems \(S ( v , 4 , 3 )\)
• Threefold triple systems with nonsingular \(N_2\)
• There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27

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)