Chain polynomials of distributive lattices are 75\% unimodal (Q1773214): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Anders Bjoerner / rank | |||
Property / reviewed by | |||
Property / reviewed by: Joseph Neggers / rank | |||
Property / author | |||
Property / author: Anders Bjoerner / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Joseph Neggers / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0411610 / rank | |||
Normal rank |
Latest revision as of 22:05, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Chain polynomials of distributive lattices are 75\% unimodal |
scientific article |
Statements
Chain polynomials of distributive lattices are 75\% unimodal (English)
0 references
25 April 2005
0 references
Since the fall of the unrestricted Neggers-Stanley conjecture its strength in various incarnations has left a residue of descendants which have stimulated activity in the area, i.e., unimodality of certain polynomials associated with certain classes of posets, as well as real-rootedness of such polynomials, the two not always being equivalent as shown in the counterexamples obtained. In this paper it is shown that the number \(c_i\) of chains of length \(i\) in the proper part of a distributive lattice \(L\) of length \(d+ 1\) satisfy the inequalities: \[ C_0<\cdots< C_{\lfloor{d-1\over 2}\rfloor}\quad\text{and}\quad C_{\lfloor{3(d-1)\over 4}\rfloor}>\cdots> C_{d-1}, \] by means of an analysis of the behavior of \(f\)-vectors and \(h\)-vectors as well as some insightful conclusions based on properties known and new of simplicial complexes as usually associated with posets. This is then presented as ``general information'', indicating possible directions to pursue in the ``program'' mentioned above, to determine the precise boundaries of conjectures as well as relations among them.
0 references
finite poset
0 references
unimodality
0 references
Neggers-Stanley conjecture
0 references