On the number of high‐dimensional partitions

DOI10.1112/plms.12586arXiv2112.02436OpenAlexW4391810002MaRDI QIDQ6150249

Dmitriy Zakharov, Cosmin Pohoata

Publication date: 6 March 2024

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.02436

zbMATH Keywords

Erdős-Szekeres-type functionssupersaturation theorem for antichains

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Algebraic aspects of posets (06A11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Maximal probabilities of convolution powers of discrete uniform distributions
• Matching theory
• On the number of graphs without 4-cycles
• Supersaturation in posets and applications involving the container method
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Applications of graph containers in the Boolean lattice
• Plane partitions in the work of Richard Stanley and his school
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• The Asymptotic Number of Lattices
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Independent sets in the hypercube revisited
• Independent sets in hypergraphs
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: On the number of high‐dimensional partitions