English
Related papers

Related papers: An explicit construction for large sets of infinit…

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

Fix a prime power $q$ and parameters $1\leq t\leq k\leq n$, the corresponding Steiner system in the Grassmann scheme, or the $q$-Steiner system, is a collection $\mathfrak{B}$ of $k$-dimensional subspaces of $\mathbb{F}_{q}^n$ such that for…

Combinatorics · Mathematics 2026-05-08 Qilong Li , Charlene Weiß , Yue Zhou

A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…

Combinatorics · Mathematics 2016-08-11 Michael Braun , Axel Kohnert , Patric Östergård , 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

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Reinhard Laue , Alfred Wassermann

There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to…

Combinatorics · Mathematics 2024-07-31 Yunjing Shan , Junling Zhou

A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…

Combinatorics · Mathematics 2025-07-01 Tuvi Etzion

A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every…

Combinatorics · Mathematics 2019-01-17 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz

A Steiner triple system is a set $S$ together with a collection $\mathcal{B}$ of subsets of $S$ of size 3 such that any two elements of $S$ belong to exactly one element of $\mathcal{B}$. It is well known that the class of finite Steiner…

Logic · Mathematics 2025-04-01 Silvia Barbina , Enrique Casanovas

A subspace representation of a poset $\mathcal S=\{s_1,...,s_t\}$ is given by a system $(V;V_1,...,V_t)$ consisting of a vector space $V$ and its subspaces $V_i$ such that $V_i\subseteq V_j$ if $s_i \prec s_j$. For each real-valued vector…

Representation Theory · Mathematics 2012-02-21 Yurii Samoilenko , Kostyantyn Yusenko

An $H(n,q,w,t)$ design is considered as a collection of $(n-w)$-faces of the hypercube $Q^n_q$ perfectly piercing all $(n-t)$-faces. We define an $A(n,q,w,t)$ design as a collection of $(n-t)$-faces of hypercube $Q^n_q$ perfectly cowering…

Combinatorics · Mathematics 2014-12-15 Vladimir N. Potapov

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…

Logic · Mathematics 2020-01-22 John Baldwin , Gianluca Paolini

We note that a strongly minimal Steiner $k$-Steiner system $(M,R)$ from (Baldwin-Paolini 2020) can be `coordinatized' in the sense of (Gantner-Werner 1975) by a quasigroup if $k$ is a prime-power. But for the basic construction this…

Logic · Mathematics 2023-02-22 John T. Baldwin

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are $S(2, 3, v)$ (Steiner triple systems), $S(3, 4, v)$ (Steiner quadruple systems), and $S(2, 4, v)$. There are a few infinite families of Steiner…

Information Theory · Computer Science 2017-06-02 Cunsheng Ding

In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that, if V is a finite vector space over a field of order q, then the number of the subspaces of…

Combinatorics · Mathematics 2009-02-19 Antonino Giorgio Spera

Let $V=V(n,q)$ denote the vector space of dimension $n$ over the finite field with $q$ elements. A subspace partition ${\mathcal P}$ of $V$ is a collection of nontrivial subspaces of $V$ such that each nonzero vector of $V$ is in exactly…

Combinatorics · Mathematics 2016-06-02 E. Nastase , P. Sissokho

A q-design with parameters t-(v,k,lambda_t)_q is a pair (V, B) of the v-dimensional vector space V over GF(q) and a collection B of k-dimensional subspaces of V, such that each t-dimensional subspace of V is contained in precisely lambda_t…

Combinatorics · Mathematics 2015-10-01 Maarten De Boeck , Anamari Nakic

A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite…

Combinatorics · Mathematics 2022-12-21 Kai-Uwe Schmidt , Charlene Weiß

A Kirkman triple system of order $v$, KTS$(v)$, is a resolvable Steiner triple system on $v$ elements. In this paper, we investigate an open problem posed by Doug Stinson, namely the existence of KTS$(v)$ which contain as a subdesign a…

Combinatorics · Mathematics 2021-10-18 Peter Dukes , Esther Lamken

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

Combinatorics · Mathematics 2016-03-25 David Ellerman
‹ Prev 1 2 3 10 Next ›