
TL;DR
This paper provides an elementary proof that quasi-symmetric designs without repeated blocks have at most 2 blocks, achieving equality only in the case of tight 4-designs, thus characterizing their maximal size.
Contribution
It offers a simple proof establishing an upper bound on the size of quasi-symmetric designs and characterizes when this bound is attained.
Findings
Maximum of 2 blocks in such designs
Equality characterizes tight 4-designs
Elementary proof approach
Abstract
I give an elementary proof that a quasi-symmetric design without repeated blocks on points has at most blocks, with equality if and only if it is a tight -design.
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 · Quasicrystal Structures and Properties
