Size of downsets in the pushing order and a problem of Berlekamp

DOI10.1016/j.dam.2006.11.022zbMath1144.05067OpenAlexW2071848419MaRDI QIDQ947102

Ulrich Tamm

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.022

zbMATH Keywords

lattice pathsmajorizationpushing order

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• A probabilistic method for lattice path enumeration
• Some aspects of groups acting on finite posets
• On maximal shadows of members in left-compressed sets
• Unimodular arrays
• Lattice paths not touching a given boundary
• The complete nontrivial-intersection theorem for systems of finite sets
• Some remarks on ballot-type sequences of positive integers
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Solution of Two Difficult Combinatorial Problems with Linear Algebra
• A class of convolution codes

This page was built for publication: Size of downsets in the pushing order and a problem of Berlekamp