English
Related papers

Related papers: Fixed block configuration group divisible designs …

200 papers

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

Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…

Combinatorics · Mathematics 2019-08-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang

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…

Combinatorics · Mathematics 2019-07-22 Coen del Valle , Peter J. Dukes

In this paper various Steiner systems $S(2,k,v)$ for $k = 6$ are collected and enumerated for specific constructions. In particular, two earlier unknown types of $1$-rotational designs are found for the groups $SL(2,5)$ and $((\mathbb Z_3…

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

In this paper we investigate the spectrum of super-simple 2-$(v,5,1)$ directed designs (or simply super-simple 2-$(v,5,1)$DDs) and also the size of their smallest defining sets. We show that for all $v\equiv1,5\ ({\rm mod}\ 10)$ except…

Combinatorics · Mathematics 2012-07-10 Nasrin Soltankhah , Farzane Amirzade

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…

Combinatorics · Mathematics 2022-09-21 Marco Buratti , Anamari Nakić

Whereas Steiner systems $S(2,k,v)$ with block length $k \le 5$ have large amount of examples and the existence is established for all admissible $v$, for $k\ge 6$ only few examples are known even for decided cases. In this paper the…

Combinatorics · Mathematics 2026-03-03 Ivan Hetman

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber

In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$, there exists a super-simple $(v,5,2)$ directed design, also for these parameters there exists a super-simple $(v,5,2)$ directed design such that its smallest defining…

Combinatorics · Mathematics 2022-07-13 M. Mohammadnezhad , S. Golalizadeh , M. Boostan , N. Soltankhah

In this note two Steiner systems $S(2,7,505)$, two Steiner systems $S(2,7,589)$, and ten Steiner systems $S(2,8,624)$ are presented. This resolves two of $21$ undecided cases for block designs with block length $7$, and one of $37$ cases…

Combinatorics · Mathematics 2026-04-14 Ivan Hetman

We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence…

Combinatorics · Mathematics 2014-10-23 Tao Feng , Xiaomiao Wang , Ruizhong Wei

We exhibit an explicit family $\mathcal{B}$ of $30$ subsets (``blocks'') of size $6$ of $[60]=\{1,2,\dots,60\}$ with the following property: for every $6$-subset $S\subset[60]$, there exists a block $B\in\mathcal{B}$ such that $|S\cap B|\ge…

Combinatorics · Mathematics 2026-01-09 Paulo Henrique Cunha Gomes

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…

Combinatorics · Mathematics 2011-10-18 Peter Dukes , Jesse Short-Gershman

Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…

Combinatorics · Mathematics 2021-03-31 Navid Nasr Esfahani , G. H. John van Rees

In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n;m, where m ? n,…

Combinatorics · Mathematics 2014-11-04 Akbar Davoodi , Ramin Javadi , Behnaz Omoomi

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

This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…

Information Theory · Computer Science 2014-09-03 Natalia Silberstein , Anna-Lena Trautmann

A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…

Combinatorics · Mathematics 2021-11-12 Andrew Clickard

In this paper we discuss the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When n=3, a 3-SCHGDD of type (3,m^t) is equivalent to a…

Combinatorics · Mathematics 2014-04-24 Tao Feng , Xiaomiao Wang , Yanxun Chang

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