English
Related papers

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

200 papers

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…

Given an STS(v), we ask if there is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. Results are obtained in the cases $\ell = 3,4$.

Combinatorics · Mathematics 2019-02-15 Donald L. Kreher , Douglas R. Stinson

The $p$-rank of a Steiner triple system $B$ is the dimension of the linear span of the set of characteristic vectors of blocks of $B$, over GF$(p)$. We derive a formula for the number of different Steiner triple systems of order $v$ and…

Combinatorics · Mathematics 2021-03-09 Minjia Shi , Li Xu , Denis S. Krotov

The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that…

Combinatorics · Mathematics 2008-07-17 Yeow Meng Chee , Alan C. H. Ling , Hao Shen

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

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

Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$-analog of a Steiner system (briefly, a $q$-Steiner system), denoted $S_q[t,k,n]$, is a set $S$ of $k$-dimensional subspaces of $\F_q^n$ such that each…

Combinatorics · Mathematics 2013-05-08 Michael Braun , Tuvi Etzion , Patric Ostergard , Alexander Vardy , Alfred Wassermann

A Steiner triple system, STS$(v)$, is a family of $3$-subsets (blocks) of a set of $v$ elements such that any two elements occur together in precisely one block. A collection of triples consisting of two copies of each block of an STS is…

Combinatorics · Mathematics 2025-04-24 Peter J. Dukes , Esther R. Lamken

We measure the rotation periods of 19 stars in the {\it Kepler} transiting planetary systems, $P_{\rm rot, astero}$ from asteroseismology and $P_{\rm rot, phot}$ from photometric variation of their lightcurve. Two stars exhibit two clear…

Earth and Planetary Astrophysics · Physics 2019-04-17 Yasushi Suto , Shoya Kamiaka , Othman Benomar

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

We find infinitely many positive non-radial solutions for a nonlinear Schrodinger-Poisson system.

Analysis of PDEs · Mathematics 2010-06-04 Pietro d'Avenia , Alessio Pomponio , Giusi Vaira

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

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

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

Combinatorics · Mathematics 2011-10-13 Nathan Linial , Zur Luria

Given an irreducible unitary representation of a cocompact lattice of SL(2,C), we explicitly write down a solution of the Strominger system of equations. These solutions satisfy the equation of motion, and the underlying holomorphic vector…

Mathematical Physics · Physics 2013-03-12 Indranil Biswas , Avijit Mukherjee

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

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

We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original…

Combinatorics · Mathematics 2013-09-02 M. Gionfriddo , E. Guardo , L. Milazzo

We report on the orbital architectures of Kepler systems having multiple planet candidates identified in the analysis of data from the first six quarters of Kepler data and reported by Batalha et al. (2013). These data show 899 transiting…