A combinatorial approach to height sequences in finite partially ordered sets
From MaRDI portal
Publication:629196
DOI10.1016/J.DISC.2010.12.020zbMATH Open1225.06001OpenAlexW2121956168MaRDI QIDQ629196FDOQ629196
Authors: Csaba Biró, William T. Trotter 
Publication date: 8 March 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.020
Recommendations
Combinatorial probability (60C05) Combinatorics of partially ordered sets (06A07) Combinatorial inequalities (05A20)
Cites Work
- Correlation inequalities on some partially ordered sets
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- An inequality for the weights of two families of sets, their unions and intersections
- Title not available (Why is that?)
- The XYZ conjecture and the FKG inequality
- A combinatorial approach to correlation inequalities
- Balancing pairs and the cross product conjecture
- A correlational inequality for linear extensions of a poset
- A Monotonicity Property of Partial Orders
- The FKG Inequality and Some Monotonicity Properties of Partial Orders
Cited In (7)
- The height of a permutation and applications to distance between real line arrangements
- The cross-product conjecture for width two posets
- Two poset polytopes
- Enumeration of series-parallel posets according to heights
- Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
- On log concavity for order-preserving maps of partial orders
This page was built for publication: A combinatorial approach to height sequences in finite partially ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629196)
