English
Related papers

Related papers: Steiner systems $S(2,6,226)$ and $S(2,6,441)$ exis…

200 papers

In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.

Combinatorics · Mathematics 2025-04-22 Ivan Hetman

In this paper various Steiner systems $S(2,k,v)$ for $k = 6$ are collected and enumerated for specific constructions. In particular, two earlier unknown types of $1$-rotational designs are found for the groups $SL(2,5)$ and $((\mathbb Z_3…

Combinatorics · Mathematics 2026-01-01 Taras Banakh , Ivan Hetman , Alex Ravsky

In this paper new Steiner systems $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$ are introduced. Also some non-existence results for line lengths $7..11$ are presented. There is no solid proof that presented algorithm is exhaustive or correct,…

Combinatorics · Mathematics 2025-04-10 Ivan Hetman

Whereas Steiner systems $S(2,k,v)$ with block length $k \le 5$ have large amount of examples and the existence is established for all admissible $v$, for $k\ge 6$ only few examples are known even for decided cases. In this paper the…

Combinatorics · Mathematics 2026-03-03 Ivan Hetman

For $v\equiv 1$ or 3 (mod 6), maximum partial triple systems on $v$ points are Steiner triple systems, STS($v$)s. The 80 non-isomorphic STS(15)s were first enumerated around 100 years ago, but the next case for Steiner triple systems was…

Combinatorics · Mathematics 2017-10-27 Fatih Demirkale , Diane Donovan , Mike Grannell

The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known that there are 12,661,527,336 isomorphism classes of STS(21)s…

Combinatorics · Mathematics 2022-08-25 Daniel Heinlein , Patric R. J. Östergård

In this paper new $1$-rotational 2-Steiner systems for different admissible $v,k$ pairs are introduced. In particular, $1$-rotational unitals of order $4$ are enumerated.

Combinatorics · Mathematics 2025-05-02 Ivan Hetman , Taras Banakh , Alex Ravsky

We obtain the number of different Steiner triple systems S(2^m-1,3,2) of rank 2^m-m+2 over the field GF(2).

Combinatorics · Mathematics 2018-04-18 Dmitrii Zinoviev

Properties of the 62,336,617 Steiner triple systems of order 21 with a non-trivial automorphism group are examined. In particular, there are 28 which have no parallel class, six that are 4-chromatic, five that are 3-balanced, 20 that avoid…

Combinatorics · Mathematics 2024-01-25 Grahame Erskine , Terry S. Griggs

Steiner triple systems (STSs) have been classified up to order 19. Earlier estimations of the number of isomorphism classes of STSs of order 21, the smallest open case, are discouraging as for classification, so it is natural to focus on…

Combinatorics · Mathematics 2023-06-22 Daniel Heinlein , Patric R. J. Östergård

In this paper we introduce enumeration of unitals of order $5$, which are also Steiner systems $S(2,6,126)$, where automorphism group acts transitively and effectively on points or fixes one point.

Combinatorics · Mathematics 2025-04-28 Ivan Hetman , Taras Banakh , Alex Ravsky

In this paper we give the first construction of a q-analog of a Steiner system. Using a computer search we found at least 26 q-Steiner Systems S_2[2,3,13] admitting the normalizer of a singer cycle as a group of automorphisms.

Combinatorics · Mathematics 2012-11-13 Michael Braun , Alfred Wassermann

We prove several structural properties of Steiner triple systems (STS) of order 3w+3 that include one or more transversal subdesigns TD(3,w). Using an exhaustive search, we find that there are 2004720 isomorphism classes of STS(21)…

Combinatorics · Mathematics 2020-06-23 Yue Guan , Minjia Shi , Denis S. Krotov

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…

Combinatorics · Mathematics 2020-05-25 Minjia Shi , Li Xu , Denis S. Krotov

The concept of Schreier extensions of loops was introduced in the general case in [11] and, more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it gives a powerful method for constructing Steiner…

Combinatorics · Mathematics 2025-01-09 Mario Galici , Giuseppe Filippone

In this article, we construct a Steiner system with the parameters $S(3,6,42)$, settling one of the smallest open parameter sets of Steiner $3$-designs. Furthermore, we establish the existence of rotational Steiner quadruple systems on $46$…

Combinatorics · Mathematics 2025-09-30 Michael Kiermaier , Vedran Krčadinac , Alfred Wassermann

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

Let S denote a Steiner triple system on an n-element set. An orientation of S is an assignment of a cyclic ordering to each of the triples in S. From an oriented Steiner triple system, one can define an anticommutative bilinear operation on…

Combinatorics · Mathematics 2025-07-15 Jake Kettinger , Chris Peterson

A Steiner quadruple system of order v is a 3-(v,4,1) design, and will be denoted SQS(v). Using the classification of finite 2-transitive permutation groups all SQS(v) with a flag-transitive automorphism group are completely classified, thus…

Combinatorics · Mathematics 2007-05-23 Michael Huber

A Steiner structure $\dS = \dS_q[t,k,n]$ is a set of $k$-dimensional subspaces of $\F_q^n$ such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly one subspace of $\dS$. Steiner structures are the $q$-analogs of Steiner…

Combinatorics · Mathematics 2012-11-13 Tuvi Etzion , Alexander Vardy
‹ Prev 1 2 3 10 Next ›