Chain lengths in the dominance lattice

DOI10.1016/J.DISC.2013.05.016zbMATH Open1281.05014OpenAlexW2044470139MaRDI QIDQ390293FDOQ390293

Authors: Edward Early 

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.016

Recommendations

• Chain lengths in the Tamari lattice
• Longest chains in the lattice of integer partitions ordered by majorization
• Publication:4863412
• Algorithms for computing lengths of chains in integral partition lattices.
• The size of the largest antichain in the partition lattice

zbMATH Keywords

dominance orderinteger partition

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Longest chains in the lattice of integer partitions ordered by majorization
• The lattice of integer partitions
• Some partitions associated with a partially ordered set
• Chain lengths in the Tamari lattice
• Title not available (Why is that?)
• Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
• Dilworth Numbers, Incidence Maps and Product Partial Orders
• Finite posets and Ferrers shapes
• The structure of Sperner k-families

Cited In (6)

• Algorithms for computing lengths of chains in integral partition lattices.
• Doppelgänger entropies
• Longest chains in the lattice of integer partitions ordered by majorization
• Chain lengths in the Tamari lattice
• The Gini index of an integer partition
• Scattering forms, worldsheet forms and amplitudes from subspaces

Uses Software

• OEIS

This page was built for publication: Chain lengths in the dominance lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390293)