Generalized packing designs

Details Generalized packing designs Generalized packing designs

2011-07-20

arxiv.org/abs/1107.4120v2

Mathematics

Combinatorics

38 pages, 2 figures, 5 tables, 2 appendices. Presented at 23rd British Combinatorial Conference, July 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Generalized packing designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized packing designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized packing designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687116