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 (m1,m2,…,m M ; L1,L2,…,L M ) 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 m i + 1 symbols in the ith column. In this paper we define k-dimensional M-part Sperner multifamilies with parameters \(L_P:~P\in\binom{[M]}{k}\) and prove \(\binom{M}{k}\) BLYM inequalities for them. We show that if k < M and all inequalities hold with equality, then these multifamilies must be homogeneous with profile matrices that are strength M − k mixed orthogonal arrays. For k = M, homogeneity is not always true, but some necessary conditions are given for certain simple families. These results extend to products of posets which have the strong normalized matching property. Following the methods of Aydinian et al. [Australasian J. Comb. 48(2010), 133–141], we give new constructions to simple mixed orthogonal arrays with constraint M, strength M − k, using m i + 1 symbols in the ith column. We extend the convex hull method to k-dimensional M-part Sperner multifamilies, and allow additional conditions providing new results even for simple 1-part Sperner families.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aydinian, H., Czabarka, É., Erdős, P.L., Székely, L.A.: A tour of M-part L-Sperner families. J. Combinatorial Theory A 118(2), 702–725 (2011)
Aydinian, H., Czabarka, É., Engel, K., Erdős, P.L., Székely, L.A.: A note on full transversals and mixed orthogonal arrays. Australasian J. Combin. 48, 133–141 (2010)
Aydinian, H., Erdős, P.L.: AZ-identities and Strict 2-part Sperner Properties of Product Posets. To appear in Order
Bollobás, B.: On generalized graphs. Acta Mathematica Academiae Scientiarum Hungaricae 16(34), 447–452 (1965)
Bush, K.A.: Orthogonal arrays, Ph.D.Thesis, North Carolina State University (1950)
Bush, K.A.: A generalization of a theorem due to MacNeish. Ann. Math. Stat. 23(2), 293–295 (1952)
Cheng, C.-S.: Orthogonal arrays with variable numbers of symbols. Ann. Statistics 8(2), 447–453 (1980)
Engel, K.: Sperner Theory. Encyclopedia of Mathematics and its Applications, vol. 65, pp. x+417. Cambridge University Press, Cambridge (1997)
Erdős, P.: On a lemma of Littlewood and Offord. Bull. of the Amer. Math. Soc. 51, 898–902 (1945)
Erdős, P.L., Frankl, P., Katona, G.O.H.: Extremal hypergraph problems and convex hulls. Combinatorica 5, 11–26 (1985)
Erdős, P.L., Füredi, Z., Katona, G.O.H.: Two-part and k-Sperner families - new proofs using permutations. SIAM J. Discrete Math. 19, 489–500 (2005)
Erdős, P.L., Katona, G.O.H.: Convex hulls of more-part Sperner families. Graphs and Combinatorics 2, 123–134 (1986)
Füredi, Z., Griggs, J.R., Odlyzko, A.M., Shearer, J.M.: Ramsey-Sperner theory. Discrete Mathematics 63, 143–152 (1987)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer Series in Statistics, pp. xxiv+416. Springer, New York (1999)
Kuhfeld, W.F.: Orthogonal Arrays List, www.support.sas.com/techsup/technote/ts723.pdf
Lubell, D.: A short proof of Sperner’s lemma. J. Comb. Theory 1(2), 299 (1966)
Meshalkin, L.D.: Generalization of Sperner’s theorem on the number of subsets of a finite set. Theory of Probability and its Applications 8(2), 203–204 (1963)
Rao, C.R.: M.A. Thesis, Calcutta University (1943)
Rao, C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. Suppl. J. Royal Stat. Soc. 9(1), 128–139 (1947)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, Part I: xv+369, Part II: ix+391. North-Holland, Amsterdam (1977)
Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27, 544–548 (1928)
Yamamoto, K.: Logarithmic order of free distributive lattice. J. Math. Soc. Japan 6, 343–353 (1954)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aydinian, H., Czabarka, É., Székely, L.A. (2013). Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)