中文
相关论文

相关论文: Nontrivial t-Designs over Finite Fields Exist for …

200 篇论文

It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…

信息论 · 计算机科学 2017-06-02 Cunsheng Ding

In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…

组合数学 · 数学 2024-09-17 Amin Saeidi

The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…

组合数学 · 数学 2019-07-22 Coen del Valle , Peter J. Dukes

A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane if every $2$-dimensional subspace of…

组合数学 · 数学 2025-10-02 Thomas Honold , Michael Kiermaier

Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…

组合数学 · 数学 2011-10-18 Peter Dukes , Jesse Short-Gershman

In this paper we relate t-designs to a forbidden configuration problem in extremal set theory. Let 1_t 0_l denote a column of t 1's on top of l 0's. We assume t>l. Let q. (1_t 0_l) denote the (t+l)xq matrix consisting of t rows of q 1's and…

组合数学 · 数学 2019-09-26 R. P. Anstee , Farzin Barekat , Zachary Pellegrin

The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…

统计理论 · 数学 2011-05-16 Runchu Zhang , Frederick K. H. Phoa , Rahul Mukerjee , Hongquan Xu

A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…

Let $F$ be a field. A $2$-$(7, 3, 1)_F$-subspace design, or $q$-Fano plane, over $F$, is a $7$-dimensional vector space $V$ over $F$ together with a collection $\mathfrak{B}$ of three-dimensional subspaces of $V$ such that every…

组合数学 · 数学 2020-06-03 Vincent van der Noort

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…

组合数学 · 数学 2011-05-10 Melissa Keranen , Melanie Laffin

Non-trivial $2$-$(k^{2},k,\lambda )$ designs, with $\lambda \mid k$, admitting a flag-transitive almost simple automorphism group are classified.

群论 · 数学 2022-03-18 Alessandro Montinaro

We establish the existence of simple designs with parameters $2$-$(55,10,4)$, $3$-$(20,5,4)$, $3$-$(21,7,30)$, $4$-$(15,5,2)$, $4$-$(16,8,45)$, $5$-$(16,7,10)$, and $5$-$(17,8,40)$, which have previously been unknown. For the corresponding…

组合数学 · 数学 2021-06-24 Vedran Krčadinac

A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its point set is contained in $G$ and the elements of each block sum up to zero. The only known Steiner 2-designs that are $G$-additive for some…

组合数学 · 数学 2022-09-21 Marco Buratti , Anamari Nakić

A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…

组合数学 · 数学 2023-06-27 Minjia Shi , XiaoXiao Li , Patrick Solé

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

群论 · 数学 2023-05-17 Ting Lan , Weijun Liu , Fu-Gang Yin

Most known quantum codes are additive, meaning the codespace can be described as the simultaneous eigenspace of an abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood…

量子物理 · 物理学 2009-11-13 John A. Smolin , Graeme Smith , Stephanie Wehner

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…

组合数学 · 数学 2026-03-20 Munenori Inagaki , Hideki Matsumura , Masanori Sawa , Yukihiro Uchida

Let $\mathcal{D}$ be a non-trivial $G$-block-transitive $3$-$(v,k,1)$ design, where $T\leq G \leq \mathrm{Aut}(T)$ for some finite non-abelian simple group $T$. It is proved that if $T$ is a simple exceptional group of Lie type, then $T$ is…

组合数学 · 数学 2023-05-25 Ting Lan , Weijun Liu , Fu-Gang Yin

The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $k$-dimensional subspaces in the $n$-dimensional vector space $\mathbb{F}^n_q$ over $\mathbb{F}_{q}$. In this paper, we define a Euclidean…

组合数学 · 数学 2023-08-31 Semin Yoo

Let $T_n(q)$ be the ring of lower triangular matrices of order $n \geq 2$ with entries from the finite field $F(q)$ of order $q \geq 2$ and let ${^2T_n(q)}$ denote its free left module. For $n=2,3$ it is shown that the projective line over…

环与代数 · 数学 2019-11-12 Edyta Bartnicka , Metod Saniga