English
Related papers

Related papers: The pasch configuration and Steiner triple systems

200 papers

Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner triple systems. With sporadic instances of small systems, ad-hoc…

Combinatorics · Mathematics 2021-10-04 Daniel Heinlein , Patric R. J. Östergård

In this article we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate…

Combinatorics · Mathematics 2025-01-09 Giovanni Falcone , Agota Figula , Mario Galici

We introduce an operation of a kind of product which associates with a partial Steiner triple system another partial Steiner triple system, the starting one being a quotient of the result. We discuss relations of our product to some other…

Combinatorics · Mathematics 2014-03-20 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

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

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

We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…

Combinatorics · Mathematics 2021-03-02 Zoltán Lóránt Nagy , Levente Szemerédi

We prove a 1973 conjecture due to Erd\H{o}s on the existence of Steiner triple systems with arbitrarily high girth.

Combinatorics · Mathematics 2024-05-07 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney , Michael Simkin

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

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

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

We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).

Combinatorics · Mathematics 2020-11-04 Asaf Ferber , Matthew Kwan

The class of $\left(\binom{n+1}{2}_{n-1} \binom{n+1}{3}_3\right)$-configurations which contain at least $n-2$ $K_n$-graphs coincides with the class of so called systems of triangle perspectives i.e. of configurations which contain a bundle…

Combinatorics · Mathematics 2014-04-17 K. Petelczyc , M. Prażmowska , K. Prażmowski

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

Combinatorics · Mathematics 2020-07-29 Matthew Kwan

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

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

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

An intriguing correspondence between certain finite planar tessellations and the Descartes circle arrangements is presented. This correspondence may be viewed as a visualization of the spinor structure underlying Descartes circles.

Metric Geometry · Mathematics 2019-10-15 Jerzy Kocik

Equations which define classical configurations of strings in $R^3$ are presented in a simple form. General properties as well as particular classes of solutions of these equations are considered.

solv-int · Physics 2009-10-30 B. G. Konopelchenko , G. Landolfi

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

Combinatorics · Mathematics 2022-01-28 John T. Baldwin
‹ Prev 1 2 3 10 Next ›