Size of Downsets in the Pushing Order and a Problem of Berlekamp

DOI10.1016/j.endm.2005.07.058zbMath1179.05116OpenAlexW2176434700MaRDI QIDQ3439292

Ulrich Tamm

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.058

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• A probabilistic method for lattice path enumeration
• 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
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• A class of convolution codes