English
Related papers

Related papers: Model theory of Steiner triple systems

200 papers

A partial Steiner triple system is is $sequenceable$ if the points can be sequenced so that no proper segment can be partitioned into blocks. We show that, if $0 \leq a \leq (n-1)/3$, then there exists a nonsequenceable PSTS$(n)$ of size…

Combinatorics · Mathematics 2019-03-22 Donald L. Kreher , Douglas R. Stinson

A Steiner triple system STS$(v)$ is called $f$-pyramidal if it has an automorphism group fixing $f$ points and acting sharply transitively on the remaining $v-f$ points. In this paper, we focus on the STSs that are $f$-pyramidal over some…

Combinatorics · Mathematics 2026-05-06 Yanxun Chang , Tommaso Traetta , Junling Zhou

In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…

Combinatorics · Mathematics 2019-12-09 Tom Bohman , Lutz Warnke

Let $V$ be a vector space over the finite field ${\mathbb F}_q$. A $q$-Steiner system, or an $S(t,k,V)_q$, is a collection ${\mathcal B}$ of $k$-dimensional subspaces of $V$ such that every $t$-dimensional subspace of $V$ is contained in a…

Combinatorics · Mathematics 2023-11-29 Daniel R. Hawtin

We construct Steiner triple systems without parallel classes for an infinite number of orders congruent to $3 \pmod{6}$. The only previously known examples have order $15$ or $21$.

Combinatorics · Mathematics 2020-07-28 Darryn Bryant , Daniel Horsley

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

The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…

Metric Geometry · Mathematics 2025-02-20 Danila Cherkashin , Emanuele Paolini , Yana Teplitskaya

A {\em cross-free} set of size $m$ in a Steiner triple system $(V,{\cal{B}})$ is three pairwise disjoint $m$-element subsets $X_1,X_2,X_3\subset V$ such that no $B\in {\cal{B}}$ intersects all the three $X_i$-s. We conjecture that for every…

Combinatorics · Mathematics 2015-09-21 Andras Gyarfas

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

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 the paper we study the structure of hyperplanes of so called binomial partial Steiner triple systems (BSTS's, in short) i.e. of configurations with $\binom{n}{2}$ points and $\binom{n}{3}$ lines, each line of the size $3$. Consequently,…

Combinatorics · Mathematics 2015-08-26 Krzysztof Petelczyc , Małgorzata Prażmowska , Krzysztof Prażmowski

A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple…

Combinatorics · Mathematics 2019-07-26 Brian Alspach , Donald L. Kreher , Adrián Pastine

A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…

Combinatorics · Mathematics 2016-04-01 Marco Buratti , Gloria Rinaldi , Tommaso Traetta

We consider a general metric Steiner problem which is of finding a set $\mathcal{S}$ with minimal length such that $\mathcal{S} \cup A$ is connected, where $A$ is a given compact subset of a given complete metric space $X$; a solution is…

Metric Geometry · Mathematics 2023-02-07 D. Cherkashin , Y. Teplitskaya

In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\ge 3$ and $n\equiv 1,3 \pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple…

Combinatorics · Mathematics 2025-07-28 Lior Gishboliner , Stefan Glock , Amedeo Sgueglia

A Steiner quadruple system (briefly $SQS(n)$) is a pair $(X,B)$ where $|X|=n$ and $B$ is a collection of 4-element blocks such that every 3-subset of $X$ is contained in exactly one member of $B$. Hanani \cite{Hanani} proved that the…

Combinatorics · Mathematics 2017-08-04 Vladimir N. Potapov

A Steinhaus triangle modulo $m$ is a finite down-pointing triangle of elements in the finite cyclic group $\mathbb{Z}/m\mathbb{Z}$ satisfying the same local rule as the standard Pascal triangle modulo $m$. A Steinhaus triangle modulo $m$ is…

Combinatorics · Mathematics 2025-08-08 Jonathan Chappelon

The aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner System $S(t,n,v)$ we associate two ideals, in a suitable polynomial ring, defining a Steiner…

Algebraic Geometry · Mathematics 2020-07-13 Edoardo Ballico , Giuseppe Favacchio , Elena Guardo , Lorenzo Milazzo

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

Let $X$ be a $v$-set, $\B$ a set of 3-subsets (triples) of $X$, and $\B^+\cup\B^-$ a partition of $\B$ with $|\B^-|=s$. The pair $(X,\B)$ is called a simple signed Steiner triple system, denoted by ST$(v,s)$, if the number of occurrences of…

Combinatorics · Mathematics 2011-11-15 E. Ghorbani , G. B. Khosrovshahi