Pairwise balanced designs covered by bounded flats
Nicholas M.A. Benson, Peter J. Dukes

TL;DR
This paper proves the existence of large pairwise balanced designs with bounded flats for any parameters, and improves bounds for specific cases, enabling constructions like Latin squares covered by small subsquares.
Contribution
It establishes the existence of pairwise balanced designs with bounded flats for all large admissible sizes and refines bounds for certain small block sizes.
Findings
Existence of PBDs with bounded flats for all large v and any K,d
Tightened upper bounds for K={3,4,5}
Constructed Latin squares covered by small subsquares
Abstract
We prove that for any and , there exist, for all sufficiently large admissible , a pairwise balanced design PBD of dimension for which all -point-generated flats are bounded by a constant independent of . We also tighten a prior upper bound for , in which case there are no divisibility restrictions on the number of points. One consequence of this latter result is the construction of latin squares `covered' by small subsquares.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
