On generalized Howell designs with block size three

DOI10.1007/S10623-015-0162-7MaRDI QIDQ306349zbMATH OpenOpenAlexFDO

Authors Robert F. Bailey, Peter Danziger, Eric Mendelsohn, R. Julian R. Abel, Andrea Burgess

Publication date 31 August 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.02502

zbMATH Keywords

doubly resolvable designsgeneralized Howell designstriple systems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25) Triple systems (05B07)

Abstract: 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$-$GH{D}_k(s,v;lambda)$, is an $simess$ array, each cell of which is either empty or contains a $k$-set of symbols from $X$, called a block, such that: (i) each symbol appears exactly once in each row and in each column (i.e. each row and column is a resolution of $X$); (ii) no $t$-subset of elements from $X$ appears in more than $lambda$ cells. Particular instances of the parameters correspond to Howell designs, doubly resolvable balanced incomplete block designs (including Kirkman squares), doubly resolvable nearly Kirkman triple systems, and simple orthogonal multi-arrays (which themselves generalize mutually orthogonal Latin squares). Generalized Howell designs also have connections with permutation arrays and multiply constant-weight codes. In this paper, we concentrate on the case that $t=2$, $k=3$ and $lambda=1$, and write $GHD(s,v)$. In this case, the number of empty cells in each row and column falls between 0 and $(s-1)/3$. Previous work has considered the existence of GHDs on either end of the spectrum, with at most 1 or at least $(s-2)/3$ empty cells in each row or column. In the case of one empty cell, we correct some results of Wang and Du, and show that there exists a $GHD(n+1,3n)$ if and only if $ngeq6$, except possibly for $n=6$. In the case of two empty cells, we show that there exists a $GHD(n+2,3n)$ if and only if $ngeq6$. Noting that the proportion of cells in a given row or column of a $GHD(s,v)$ which are empty falls in the interval $[0,1/3)$, we prove that for any $piin[0,5/18]$, there is a $GHD(s,v)$ whose proportion of empty cells in a row or column is arbitrarily close to $pi$.

Recommendations

• On existence of two classes of generalized Howell designs with block size three and index two
• scientific article; zbMATH DE number 4181344
• Existence of generalized Howell designs of side \(n+1\) and order \(3n\)
• scientific article; zbMATH DE number 874525
• Howell designs with sub-designs

Cites work

• scientific article; zbMATH DE number 3713743 (Why is no real title available?)
• scientific article; zbMATH DE number 3758356 (Why is no real title available?)
• scientific article; zbMATH DE number 124517 (Why is no real title available?)
• scientific article; zbMATH DE number 3485815 (Why is no real title available?)
• scientific article; zbMATH DE number 1161271 (Why is no real title available?)
• scientific article; zbMATH DE number 3797764 (Why is no real title available?)
• scientific article; zbMATH DE number 3893245 (Why is no real title available?)
• A doubly divisible nearly Kirkman system
• A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
• A generalisation of \(t\)-designs
• Bounds for permutation arrays
• Constructions for permutation codes in powerline communications
• Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• Doubly resolvable designs
• Doubly resolvable designs from generalized Bhaskar Rao designs
• Doubly resolvable nearly Kirkman triple systems
• Every SOMA\((n - 2, n)\) is Trojan
• Existence of 2 SOLS and 2 ISOLS
• Existence of Five MOLS of Orders 18 and 60
• Existence of generalized Howell designs of side \(n+1\) and order \(3n\)
• Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\)
• Four Mutually Orthogonal Latin Squares of Order 14
• Generalized packing designs
• More mutually orthogonal latin squares
• Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
• Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
• On Mutually Orthogonal Resolutions and Near-Resolutions
• On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
• On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares
• Optimal doubly constant weight codes
• Orthogonally resolvable cycle decompositions
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Powerline communication and the 36 officers problem
• Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\)
• The CRC handbook of combinatorial designs
• The existence of Howell designs of even side
• The existence of Howell designs of odd side
• The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
• The existence of Room squares
• The existence of doubly resolvable \((v,3,2)\)-BIBDs
• The existence of four HMOLS with equal sized holes
• The existence of orthogonal resolutions of lines in AG(n,q)
• Transversal designs and doubly-resolvable designs

Cited in

(8)

• Optimal multiply constant-weight codes from generalized Howell designs
• Constructions of optimal multiply constant-weight codes MCWC\((3,n_1; 1,n_2; 1,n_3; 8)s\)
• The existence of skew Howell designs of side 2n and order \(2n+2\)
• Existence of generalized Howell designs of side \(n+1\) and order \(3n\)
• On existence of two classes of generalized Howell designs with block size three and index two
• The asymptotic existence of frames with a pair of orthogonal frame resolutions
• Generalized neighbor designs with block size 3
• Frames and doubly resolvable group divisible designs with block size three and index two

This page was built for publication: On generalized Howell designs with block size three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306349)