arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.4120math.CO
收藏

广义填充设计

Generalized packing designs

Robert F. Bailey, Andrea C. Burgess

摘要:

广义$t$ -设计,其形成诸如$t$ -设计、可分解设计和正交阵列的对象的共同概括,由Cameron定义[P. J. Cameron,A generalisation of $t$ -designs,\emph{Discrete Math.} \ { \bf 309}(2009),4835--4842]。本文定义了一类相关的组合设计,它同时推广了填充设计和填充阵列。我们描述了有时令人惊讶的连接,这些广义设计与各种已知类的组合设计,包括豪厄尔设计,部分拉丁方和几个类的三元系,也有概念,如可分解性和块着色的普通设计和包装,正交决议和着色。此外,我们还得到了广义填充设计的大小的界,并在某些情况下构造了最优广义填充。特别是,我们提供的方法来构建最大广义填充与$t=2$和块大小$k=3$或4。

英文摘要:

Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309} (2009), 4835--4842]. In this paper, we define a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays. We describe the sometimes surprising connections which these generalized designs have with various known classes of combinatorial designs, including Howell designs, partial Latin squares and several classes of triple systems, and also concepts such as resolvability and block colouring of ordinary designs and packings, and orthogonal resolutions and colourings. Moreover, we derive bounds on the size of a generalized packing design and construct optimal generalized packings in certain cases. In particular, we provide methods for constructing maximum generalized packings with $t=2$ and block size $k=3$ or 4.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑