Bounds on the number of higher-dimensional partitions

DOI10.1090/PROC/16609arXiv2302.04799OpenAlexW4385324929MaRDI QIDQ6154340FDOQ6154340

Authors: Damir Yeliussizov 

Publication date: 15 February 2024

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

Abstract: We establish some bounds on the number of higher-dimensional partitions by volume. In particular, we give bounds via vector partitions and MacMahon's numbers.

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

zbMATH Keywords

MacMahon's conjectureMacMahon's numbers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Bounds for the number of multidimensional partitions

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

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