If \(S\) is a finite set with some rank with log-concave Whitney numbers satisfying \(w_{k - 1} < w_k \leq w_{k + m}\), \(W = w_k + w_{k + 1} + \cdots + w_{k + m}\), \(F\) is a subset of \(S\) of cardinality at least \(W\) with a LYM-type normalized profile vector then the average rank of \(F\) is at least \((kw_k + \cdots + (k + m) w_{k + m})/W\). This generalizes a theorem of D. J. Kleitman and E. C. Milner. An inequality on log-concave sequences of positive reals is also established.
Recommendations
Cites work
- A short proof of Sperner's lemma
- Extremal hypergraph problems and convex hulls
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 4063157 (Why is no real title available?)
- scientific article; zbMATH DE number 3465294 (Why is no real title available?)
- scientific article; zbMATH DE number 3636041 (Why is no real title available?)
- Logarithmic order of free distributive lattice
- On a lemma of Littlewood and Offord
- On the average size of the sets in a Sperner family
- Some Results on Matching in Bipartite Graphs
Cited in
(3)
This page was built for publication: On the average rank of LYM-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898339)
