English
Related papers

Related papers: q-Steiner Systems Do Exist

200 papers

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 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 $q$-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the $q$-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal $q$-analogs covering designs…

Combinatorics · Mathematics 2015-03-13 Tuvi Etzion , Alexander Vardy

Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.

Combinatorics · Mathematics 2026-05-20 Taras Banakh , Ivan Hetman , Alex Ravsky

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

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…

The $q$-Fano plane is the $q$-analog of the Steiner system $S(2,3,7)$. For any given prime power $q$ it is not known whether the $q$-Fano plane exists or not. We consider the structure of the $q$-Fano plane for any given $q$ and conclude…

Combinatorics · Mathematics 2015-08-25 Tuvi Etzion

One of the most intriguing problems, in $q$-analogs of designs and codes, is the existence question of an infinite family of $q$-analog of Steiner systems (spreads not included) in general, and the existence question for the $q$-analog of…

Combinatorics · Mathematics 2017-02-07 Tuvi Etzion

In this paper we present a graph theoretic construction of Steiner quadruple systems (SQS) admitting abelian groups as point-regular automorphism groups. The resulting SQS has an extra property which we call A-reversibility, where A is the…

Combinatorics · Mathematics 2017-10-20 Akihiro Munemasa , Masanori Sawa

In this paper new Steiner systems $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$ are introduced. Also some non-existence results for line lengths $7..11$ are presented. There is no solid proof that presented algorithm is exhaustive or correct,…

Combinatorics · Mathematics 2025-04-10 Ivan Hetman

The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known that there are 12,661,527,336 isomorphism classes of STS(21)s…

Combinatorics · Mathematics 2022-08-25 Daniel Heinlein , Patric R. J. Östergård

We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not…

Information Theory · Computer Science 2021-01-26 Heide Gluesing-Luerssen , Hunter Lehmann

We prove that if $p \geq n^{-(q-6)/2}$, then asymptotically almost surely the binomial random $q$-uniform hypergraph $G^{(q)}(n,p)$ contains an $(n,q,2)$-Steiner system, provided $n$ satisfies the necessary divisibility conditions.

Combinatorics · Mathematics 2024-02-29 Michelle Delcourt , Tom Kelly , Luke Postle

Steiner triple systems (STSs) have been classified up to order 19. Earlier estimations of the number of isomorphism classes of STSs of order 21, the smallest open case, are discouraging as for classification, so it is natural to focus on…

Combinatorics · Mathematics 2023-06-22 Daniel Heinlein , Patric R. J. Östergård

A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…

Combinatorics · Mathematics 2019-03-04 Marco Buratti , Michael Kiermaier , Sascha Kurz , Anamari Nakić , Alfred Wassermann

Let $N=L_n(q)$, {$n \geq 2$}, $q$ a prime power, be a projective linear simple group. We classify all Steiner quadruple systems admitting a group $G$ with $N \leq G \leq \Aut(N)$. In particular, we show that $G$ cannot act as a group of…

Combinatorics · Mathematics 2018-07-03 Michael Huber

One more model of a q-harmonic oscillator based on the q-orthogonal polynomials of Al-Salam and Carlitz is discussed. The explicit form of q-creation and q-annihilation operators, q-coherent states and an analog of the Fourier…

Classical Analysis and ODEs · Mathematics 2016-09-06 Richard A. Askey , Serge\uı K. Suslov

A model of a q-harmonic oscillator based on q-Charlier polynomials of Al-Salam and Carlitz is discussed. Simple explicit realization of q-creation and q-annihilation operators, q-coherent states and an analog of the Fourier transformation…

Classical Analysis and ODEs · Mathematics 2009-10-22 Richard A. Askey , Serge\uı K. Suslov

An algebraic process for the construction of an autotopism for a non-Steiner C-loop is described and this is demonstrated with an example using a known finite C-loop. In every C-loop, two of its parastrophes are not equivalent(equal) it, if…

General Mathematics · Mathematics 2008-06-05 Temitope Gbolahan Jaiyeola , John Olushola Adeniran

Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is will known that Steiner quadruple systems of order v, or SQS(v), exist if and only if v = 2, 4 mod 6. Universal cycles, introduced by…

Combinatorics · Mathematics 2012-04-17 Victoria Horan , Glenn Hurlbert
‹ Prev 1 2 3 10 Next ›