English
Related papers

Related papers: Model theory of Steiner triple systems

200 papers

Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…

Combinatorics · Mathematics 2026-01-27 Xiao-Nan Lu

We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…

Logic in Computer Science · Computer Science 2015-06-05 Domenico Cantone , Marianna Nicolosi-Asmundo

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

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

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

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

By a famous result of Doyen, Hubaut and Vandensavel \cite{DHV}, the 2-rank of a Steiner triple system on $2^n-1$ points is at least $2^n -1 -n$, and equality holds only for the classical point-line design in the projective geometry…

Combinatorics · Mathematics 2018-08-07 Dieter Jungnickel , Vladimir D. Tonchev

The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…

Optimization and Control · Mathematics 2014-08-13 Andrea Marchese , Annalisa Massaccesi

The famous Haken-Kneser-Milnor theorem states that every 3-manifold can be expressed in a unique way as a connected sum of prime 3-manifolds. The analogous statement for 3-orbifolds has been part of the folklore for several years, and it…

Geometric Topology · Mathematics 2015-06-26 Carlo Petronio

An l-good sequencing of a Steiner triple system of order v, STS(v), is a permutation of the points of the system such that no l consecutive points in the permutation contains a block. It is known that every STS(v) with v > 3 has a 3-good…

Combinatorics · Mathematics 2022-04-07 Grahame Erskine , Terry Griggs

The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…

General Economics · Economics 2025-08-14 Athanasios Andrikopoulos , Nikolaos Sampanis

A partial Steiner triple system whose triples can be partitioned into $s$ partial parallel classes, each of size $m$, is a $signal$ $set$, denoted $\mbox{SS}(v,s,m)$. A $Kirkman$ $signal$ $set$ $\mbox{KSS}(v,m)$ is an $\mbox{SS}(v,s,m)$…

Combinatorics · Mathematics 2017-07-25 Melissa S. Keranen , Donald L. Kreher

Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…

Combinatorics · Mathematics 2020-07-21 Tuvi Etzion , Junling Zhou

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

The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…

Combinatorics · Mathematics 2015-09-15 S. R. Kingan , Manoel Lemos

There exists an infinite family of examples of subsets of $\mathbb{F}_q^2$ with $q^{4/3}$ elements whose distance sets are not the whole of $\mathbb{F}_q$.

Combinatorics · Mathematics 2019-05-23 Brendan Murphy , Giorgis Petridis

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Logic · Mathematics 2010-03-16 Fredrik Engström

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An…

Combinatorics · Mathematics 2024-05-14 Grahame Erskine , Terry S. Griggs