Content area
Конспект
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special characters omitted] is a subset of [special characters omitted] where no two members of [special characters omitted] are related to each other. The LYM inequality is a generalization of Sperner's Theorem and imposes a weighted density condition on an anti-chain. Intuitively one would conjecture that large density would inhibit the existence of an anti-chain. When handed a collection of objects [special characters omitted] from a poset [special characters omitted] a natural question to ask is whether [special characters omitted] is an anti-chain. If a set [special characters omitted] does not satisfy the LYM inequality, we know that it is not an anti-chain. In a recent paper, Bey refined this density condition for the poset 2 [n]: In this dissertation, we present a polynomial LYM inequality for certain ranked posets derived from association schemes. To do this we establish a new class of association schemes of finite, complemented, modular lattices. We also present examples using this general polynomial LYM inequality for the Boolean lattice, the vector space lattice over a finite field, and a lattice constructed from affine lines.
