Mixed orthogonal arrays, $k$-dimensional $M$-part Sperner multi-families, and full multi-transversals
Harout Aydinian, \'Eva Czabarka, L\'aszl\'o A. Sz\'ekely

TL;DR
This paper generalizes Sperner families using mixed orthogonal arrays, establishing new inequalities and conditions for homogeneity, and introduces constructions for complex array structures with applications to combinatorial design theory.
Contribution
It introduces k-dimensional M-part Sperner multi-families, proves multiple BLYM inequalities, and develops new constructions for mixed orthogonal arrays with specific constraints.
Findings
Homogeneity of multi-families under equality conditions for k<M
New BLYM inequalities for k-dimensional M-part Sperner multi-families
Extended convex hull method for Sperner families
Abstract
Aydinian et al. [J. Combinatorial Theory A 118(2)(2011), 702-725] substituted the usual BLYM inequality for L-Sperner families with a set of M inequalities for type M-part Sperner families and showed that if all inequalities hold with equality, then the family is homogeneous. Aydinian et al. [Australasian J. Comb. 48(2010), 133-141] observed that all inequalities hold with equality if and only if the transversal of the Sperner family corresponds to a simple mixed orthogonal array with constraint M, strength M-1, using symbols in the column. In this paper we define -dimensional -part Sperner multi-families with parameters and prove BLYM inequalities for them. We show that if k<M and all inequalities hold with equality, then these multi-families must be homogeneous with profile…
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 · Optimal Experimental Design Methods · Coding theory and cryptography
