Bounds on the number of higher-dimensional partitions

DOI10.1090/proc/16609arXiv2302.04799OpenAlexW4385324929MaRDI QIDQ6154340

Damir Yeliussizov

Publication date: 15 February 2024

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

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

zbMATH Keywords

MacMahon's conjectureMacMahon's numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Asymptotic enumeration (05A16) Lattice points in specified regions (11P21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on higher-dimensional partitions
• Motivic degree zero Donaldson-Thomas invariants
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Estimating the asymptotics of solid partitions
• On the number of convex lattice polytopes
• On the cardinality of lower sets and universal discretization
• Plane partitions in the work of Richard Stanley and his school
• On the asymptotics of higher dimensional partitions
• Asymptotic results for the number of multidimensional partitions of an integer and directed compact lattice animals
• A Note on Solid Partitions
• Theory and Application of Plane Partitions. Part 2
• Magnificent four
• MacMahon’s statistics on higher-dimensional partitions

This page was built for publication: Bounds on the number of higher-dimensional partitions