Optimal shadows and ideals in submatrix orders
暂无分享,去创建一个
Abstract The main result of this article is in proving a conjecture by Sali. We obtain a Kruskal–Katona-type theorem for the poset P(N;A,B) , which for a finite set N and disjoint subsets A,B⊆N is the set {F⊆N | F∩A≠∅≠F∩B} , ordered by inclusion. Such posets are known as submatrix orders. As an application we give a solution to the problem of finding an ideal of given size and maximum weight in submatrix orders and in their duals.
[1] Peter Frankl,et al. A new short proof for the Kruskal-Katona theorem , 1984, Discret. Math..
[2] F. S. Macaulay. Some Properties of Enumeration in the Theory of Modular Systems , 1927 .
[3] K. Engel. Sperner Theory , 1996 .
[4] Gyula O. H. Katona,et al. Intersection theorems for systems of finite sets , 1964 .