English
Related papers

Related papers: Nontrivial t-Designs over Finite Fields Exist for …

200 papers

Let $\mathbb{F}$ be an algebraically closed field of characteristic zero. Recently, we proved that isotypic blocks are functorially equivalent over $\mathbb{F}$. In this article we provide an example of functorially equivalent blocks which…

Group Theory · Mathematics 2024-01-18 Deniz Yılmaz

We show that there exists $k \in \bbn$ and $0 < \e \in\bbr$ such that for every field $F$ of characteristic zero and for every $n \in \bbn$, there exists explicitly given linear transformations $T_1,..., T_k: F^n \to F^n$ satisfying the…

Group Theory · Mathematics 2008-04-15 A. Lubotzky , E. Zelmanov

The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…

Information Theory · Computer Science 2017-04-06 Cunsheng Ding , Hao Liu , Vladimir D. Tonchev

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasi-symmetric 2-$(56,12,9)$ and 2-$(57,12,11)$ designs with intersection numbers 0 and 3, and the…

Combinatorics · Mathematics 2020-06-09 Akihiro Munemasa , Vladimir D. Tonchev

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

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Information Theory · Computer Science 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong

We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…

Combinatorics · Mathematics 2026-05-07 Alexey Gordeev , Lars-Daniel Öhman

A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n - k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies…

Combinatorics · Mathematics 2012-01-17 Geertrui Van de Voorde

In this article, we study $2$-designs with $\gcd(r, \lambda)=1$ admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine all pairs…

Group Theory · Mathematics 2019-09-19 Seyed Hassan Alavi , Mohsen Bayat , Ashraf Daneshkhah

It is well know that the theory of minimal blocking sets is studied by several author. Another theory which is also studied by a large number of researchers is the theory of hyperplane arrangements. We can remark that the affine space…

Information Theory · Computer Science 2008-02-15 Simona Settepanella

Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…

Combinatorics · Mathematics 2018-09-05 Yu-pei Huang , Chia-an Liu , Yaotsu Chang , Chong-Dao Lee

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain…

Combinatorics · Mathematics 2007-12-27 Yeow Meng Chee , Petteri Kaski

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

The aim of this paper is to present a construction of $t$-divisible designs for $t>3$, because such divisible designs seem to be missing in the literature. To this end, tools such as finite projective spaces and their algebraic varieties…

Combinatorics · Mathematics 2024-02-05 Andrea Blunck , Hans Havlicek , Corrado Zanella

Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…

Combinatorics · Mathematics 2021-11-02 Eiichi Bannai , Etsuko Bannai , Sho Suda , Hajime Tanaka

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Combinatorics · Mathematics 2018-10-16 William M. Kantor

In this paper, a family of non-weight modules over Lie superalgebras $S(q)$ of Block type are studied. Free $U(\eta)$-modules of rank $1$ over Ramond-Block algebras and free $U(\mathfrak{h})$-modules of rank $2$ over Neveu-Schwarz-Block…

Representation Theory · Mathematics 2021-01-27 Yucai Su , Xiaoqing Yue , Xiaoyu Zhu

The main aim of this paper is to prove $R$-triviality for simple, simply connected algebraic groups with Tits index $E_{8,2}^{78}$ or $E_{7,1}^{78}$, defined over a field $k$ of arbitrary characteristic. Let $G$ be such a group. We prove…

Group Theory · Mathematics 2017-04-26 Maneesh Thakur

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

Geometric Topology · Mathematics 2015-08-13 Isaac Mabillard , Uli Wagner

A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…

Information Theory · Computer Science 2015-03-24 Cunsheng Ding
‹ Prev 1 8 9 10 Next ›