English
Related papers

Related papers: Group divisible designs with block size five

200 papers

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

Information Theory · Computer Science 2016-11-18 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Erry Gunawan , Er Yang Zhang

A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…

Combinatorics · Mathematics 2025-01-14 Anthony Forbes , Carrie Rutherford

A \textbf{double-change covering design} (DCCD) is a $v$-set $V$ and an ordered list $\mathcal{L}$ of $b$ blocks of size $k$ where every pair from $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly…

Combinatorics · Mathematics 2025-11-04 Amanda Lynn Chafee , Brett Stevens

In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…

Number Theory · Mathematics 2022-08-04 Qi-Yang Zheng

The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…

Number Theory · Mathematics 2012-10-19 Gene Ward Smith

We investigate a degree 5 invariant of groups of type E8 and give its applications to the structure of finite subgroups in algebraic groups.

Representation Theory · Mathematics 2010-04-06 Skip Garibaldi , Nikita Semenov

Computational techniques for the construction of quasi-symmetric block designs are explored and applied to the case with $56$ points. One new $(56,16,18)$ and many new $(56,16,6)$ designs are discovered, and non-existence of $(56,12,9)$ and…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Renata Vlahović Kruc

One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial…

Combinatorics · Mathematics 2018-07-03 Michael Huber

We present GUT models based on an $SU(5)\times SU(5)$ GUT group. These models maintain the main successes of simple-group GUTs but permit simple solutions to the doublet-triplet splitting problem. Moreover, GUT breaking is triggered by…

High Energy Physics - Phenomenology · Physics 2007-05-23 Yael Shadmi

Let $G$ be a simple algebraic group over an algebraically closed field $K$ with Lie algebra $\mathfrak{g}$. For unipotent elements $u \in G$ and nilpotent elements $e \in \mathfrak{g}$, the Jordan block sizes of $\operatorname{Ad}(u)$ and…

Group Theory · Mathematics 2024-01-30 Mikko Korhonen

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…

Combinatorics · Mathematics 2015-11-04 R. Julian R. Abel , Robert F. Bailey , Andrea C. Burgess , Peter Danziger , Eric Mendelsohn

We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {\alpha; \beta; k; t}, where k is the number of information symbols, each codeword of an…

Information Theory · Computer Science 2015-07-30 Wentu Song , Son Hoang Dau , Chau Yuen

This paper considers two closely related concepts, mixed Steiner system and nonuniform group divisible design (GDD). The distinction between the two concepts is the minimum Hamming distance, which is required for mixed Steiner systems but…

Combinatorics · Mathematics 2025-10-29 Tuvi Etzion , Yuli Tan , Junling Zhou

We present a solution to the doublet-triplet splitting problem in supersymmetric $SU(5)$ by enlarging the group to $SU(5)\times SU(5)$ and by introducing two supermultiplets in the $(5,5)$ and $(\bar{5},\bar{5})$ representations of the…

High Energy Physics - Phenomenology · Physics 2019-05-14 Renata Jora

We give a new construction of difference families generalizing Szekeres's difference families \cite{Sze}. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of…

Combinatorics · Mathematics 2012-12-14 Koji Momihara , Mieko Yamada

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

Combinatorics · Mathematics 2023-05-09 M. Epstein , D. L. Kreher , S. S. Magliveras

In this paper, we show that for all v\pmod 1 (mod 3), there exists a super- simple (v, 4, 2) directed design. Also, we show that for these parameters there exists a super-simple (v, 4, 2) directed design whose each defining set has at least…

Combinatorics · Mathematics 2015-08-04 M. Boostan , S. Golalizadeh , N. Soltankhah

A $2$-$(v,k,\lambda)$ design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group $G$ in such a way that its block set is contained in (or coincides with) the set of all the zero-sum $k$-subsets of…

Combinatorics · Mathematics 2023-07-18 Marco Buratti , Anamari Nakic

We find a five-parameter family of partial differential systems in two variables with two polynomial Hamiltonians. We give its symmetry and holomorphy conditions. These symmetries, holomorphy conditions and invariant divisors are new.

Algebraic Geometry · Mathematics 2009-11-18 Yusuke Sasano

In this paper, we give a partial solution to a new isomorphism problem about $2$-$(v,k,k-1)$ designs from disjoint difference families in finite fields and Galois rings. Our results are obtained by carefully calculating and bounding some…

Combinatorics · Mathematics 2019-11-21 Christian Kaspers , Alexander Pott
‹ Prev 1 3 4 5 6 7 10 Next ›