English
Related papers

Related papers: Point-transitive Steiner systems S(2,6,111/121/126…

200 papers

Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.

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

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 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

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

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

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

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

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

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

We solve the long-standing open problem of classifying all 3-(v,k,1) designs with a flag-transitive group of automorphisms (cf. A. Delandtsheer, Geom. Dedicata 41 (1992), p. 147; and in: "Handbook of Incidence Geometry", ed. by F.…

Combinatorics · Mathematics 2018-07-04 Michael Huber

In this paper we complete a classification of finite linear spaces $\cS$ with line size at most 12 admitting a line-transitive point-imprimitive subgroup of automorphisms. The examples are the Desarguesian projective planes of orders $4,7,…

Combinatorics · Mathematics 2007-05-23 Cheryl E. Praeger , Shenglin Zhou

We give a construction of a family of designs with a specified point-partition, and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in the family to…

Combinatorics · Mathematics 2015-02-25 Peter J. Cameron , Cheryl E. Praeger

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

If $G$ is a finite group then there is an integer $M_G$ such that$,$ for $u\ge M_G$ and $u\equiv 1$ or $3$ (mod 6), there is a Steiner triple system $U$ on $u$ points for which ${\rm Aut} U \cong G. \ $ If $V$ is a Steiner triple system…

Combinatorics · Mathematics 2022-04-11 Jean Doyen , William M. Kantor

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

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently…

Combinatorics · Mathematics 2018-07-03 Michael Huber

The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…

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

In this paper we present a graph theoretic construction of Steiner quadruple systems (SQS) admitting abelian groups as point-regular automorphism groups. The resulting SQS has an extra property which we call A-reversibility, where A is the…

Combinatorics · Mathematics 2017-10-20 Akihiro Munemasa , Masanori Sawa

This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…

Combinatorics · Mathematics 2024-08-28 Yunsong Gan , Weijun Liu
‹ Prev 1 2 3 10 Next ›