Title of article
Resolvability of infinite designs
Author/Authors
Danziger، نويسنده , , Peter and Horsley، نويسنده , , Daniel and Webb، نويسنده , , Bridget S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
13
From page
73
To page
85
Abstract
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t- ( v , k , Λ ) design with t finite, v infinite and k , λ < v is resolvable and, in fact, has α orthogonal resolutions for each α < v . We also show that, while a t- ( v , k , Λ ) design with t and λ finite, v infinite and k = v may or may not have a resolution, any resolution of such a design must have v parallel classes containing v blocks and at most λ − 1 parallel classes containing fewer than v blocks. Further, a resolution into parallel classes of any specified sizes obeying these conditions is realisable in some design. When k < v and λ = v and when k = v and λ is infinite, we give various examples of resolvable and non-resolvable t- ( v , k , Λ ) designs.
Keywords
Infinite design , RESOLUTION , Resolvable , Parallel class
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2014
Journal title
Journal of Combinatorial Theory Series A
Record number
1531986
Link To Document