Chain polynomials of distributive lattices are 75% unimodal

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

It is shown that the numbers ci of chains of length i in the proper part L \ {0,1} of a distributive lattice L of length ℓ + 2 satisfy the inequalities C0 < ...... > cℓ. This proves 75% of the inequalities implied by the Neggers unimodality conjecture.

References Powered by Scopus

Shellable and cohen-macaulay partially ordered sets

337Citations
N/AReaders
Get full text

The number of faces of a simplicial convex polytope

283Citations
N/AReaders
Get full text

A monotonicity property of h-vectors and h<sup>*</sup>-vectors

75Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Actions on permutations and unimodality of descent polynomials

74Citations
N/AReaders
Get full text

F-Vectors of barycentric subdivisions

54Citations
N/AReaders
Get full text

Counterexamples to the poset conjectures of neggers, stanley, and stembridge

20Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Björner, A., & Farley, J. D. (2005). Chain polynomials of distributive lattices are 75% unimodal. Electronic Journal of Combinatorics, 12(1 N), 1–7. https://doi.org/10.37236/1971

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

60%

Lecturer / Post doc 1

20%

PhD / Post grad / Masters / Doc 1

20%

Readers' Discipline

Tooltip

Mathematics 4

67%

Computer Science 2

33%

Save time finding and organizing research with Mendeley

Sign up for free