Difference Methods for Double Change Covering Designs

MaRDI QIDQ6411855zbMATH OpenFDO

Authors Brett Stevens

Publication date 25 September 2022

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: A extbf{double change covering design} is a $v$-set $X$ and an ordered list $mathcalL$ of $b$ blocks of size $k$ where every $t$-set must occur in at least one block. Each pair of consecutive blocks differs by exactly two elements. A double change covering design is circular when the first and last blocks also differ by two elements. We give a recursive construction that uses 1-factorizations and expansion sets to increase $v$ by $fracv+k-2k-2$. We construct $mCDCCD(2k-2,k,k-1)$ and $mCDCCD(2k-1,k,k-2)$ from single change covering designs. We use difference methods to construct tight $$, five infinite families for any $kgeq3$, minimum $mCDCCD(c(4k-6)+1,k,c^2(4k-6)+c)$ when $cleq5$ and $mCDCCD(61,4,366)$. Finally, from these, we use the recursion to construct twelve additional minimum CDCCD.

This page was built for publication: Difference Methods for Double Change Covering Designs

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