Chain polynomials of distributive lattices are 75 % unimodal
classification
🧮 math.CO
keywords
distributiveinequalitieslengthlfloorquadrfloorchainchains
read the original abstract
It is shown that the numbers $c_i$ of chains of length $i$ in the proper part $L\setminus\{0,1\}$ of a distributive lattice $L$ of length $\ell +2$ satisfy the inequalities $$c_0<...<c_{\lfloor{\ell /2}\rfloor} \quad{and}\quad c_{\lfloor{3 \ell /4}\rfloor}>...>c_{\ell}.$$ This proves 75 % of the inequalities implied by the Neggers unimodality conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.