English
Related papers

Related papers: Simple signed Steiner triple systems

200 papers

Let B be an n by n doubly substochastic matrix. We show that B can be written as a convex combination of no more than {\sigma}(B)+t subpermutation matrices, where {\sigma}(B) is the number of nonzero elements in B and t is the number of…

Combinatorics · Mathematics 2018-01-08 Lei Cao

Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…

Logic · Mathematics 2026-02-25 Silvia Barbina , Enrique Casanovas

In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let $B (\cdot, \cdot)$ be a non-degenerate bilinear form and $E$ be a set in…

Number Theory · Mathematics 2024-05-07 Thang Pham , Steven Senger , Nguyen Trung-Tuan , Nguyen Duc-Thang , Le Anh Vinh

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.

Combinatorics · Mathematics 2025-04-22 Ivan Hetman

Given a connected graph $G$ and a terminal set $R \subseteq V(G)$, the minimum Steiner tree problem (ST) asks for a tree that spans all of $R$ with at most $r$ vertices from $V(G)\backslash R$, for some integer $r\geq 0$. A \emph{split…

Discrete Mathematics · Computer Science 2026-05-29 Jyothish S , Sadagopan Narasimhan

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

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

Combinatorics · Mathematics 2014-05-15 Felix Goldberg , Deepak Rajendraprasad , Rogers Mathew

A directed triple system of order $v$ (or, DTS$(v)$) is decomposition of the complete directed graph $\vec{K_v}$ into transitive triples. A $v$-good sequencing of a DTS$(v)$ is a permutation of the points of the design, say $[x_1 \; \cdots…

Combinatorics · Mathematics 2019-07-26 Donald L. Kreher , Douglas R. Stinson , Shannon Veitch

We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…

Group Theory · Mathematics 2024-02-28 James Belk , Collin Bleak , Martyn Quick , Rachel Skipper

Let $p$ be an odd prime. For nontrivial proper subsets $A,B$ of $\mathbb{Z}_p$ of cardinality $s,t$, respectively, we count the number $r(A,B,B)$ of additive triples, namely elements of the form $(a, b, a+b)$ in $A \times B \times B$. For…

Combinatorics · Mathematics 2024-05-09 Sophie Huczynska , Jonathan Jedwab , Laura Johnson

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

A Mendelsohn triple system of order $v$ (or MTS$(v)$) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges $(x,y)$, $(y,z)$ and $(z,x)$ by $(x,y,z)$, $(y,z,x)$ or $(z,x,y)$. An…

Combinatorics · Mathematics 2019-09-17 Donald L. Kreher , Douglas R. Stinson , Shannon Veitch

We show that the number of short binary signed-digit representations of an integer $n$ is equal to the $n$-th term in the Stern sequence. Various proofs are provided, including direct, bijective, and generating function proofs. We also show…

Combinatorics · Mathematics 2023-08-16 Katie Anders , Madeline Locus Dawsey , Rajat Gupta , Joseph Vandehey

The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…

Number Theory · Mathematics 2021-08-30 Laura Monroe

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

Combinatorics · Mathematics 2020-12-07 Simona Bonvicini , Marco Buratti , Martino Garonzi , Gloria Rinaldi , Tommaso Traetta

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

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

For two coprime positive integers $a,b$, let $T(a,b)=\{ ax+by : x,y\in \mathbb{Z}_{\ge 0} \} $ and let $s(a,b)=ab-a-b$. It is well known that all integers which are greater than $s(a,b)$ are in $T(a,b)$. Let $\pi (a, b)$ be the number of…

Number Theory · Mathematics 2025-06-05 Yong-Gao Chen , Hui Zhu

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
‹ Prev 1 3 4 5 6 7 10 Next ›