On the number of high‐dimensional partitions

DOI10.1112/PLMS.12586MaRDI QIDQ6150249zbMATH OpenOpenAlexFDO

Authors Cosmin Pohoata, D. D. Zakharov

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

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

Abstract: Let $P_d(n)$ denote the number of $nimesldotsimesn$ $d$-dimensional partitions with entries from $left0,1,ldots,night$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $doinfty$, ${\displaystyle }$P_{d}(n) = 2^{(1+o_{d}(1)) sqrt{frac{6}{(d+1)pi}} cdot n^{d}}${\displaystyle }$ holds for all $ngeq1$. This settles a conjecture of Moshkovitz-Shapira [Adv. in Math. 262 (2014), 1107--1129]. Via the main result of Moshkovitz and Shapira, our estimate also determines asymptotically a Ramsey theoretic parameter related to ErdH{o}s-Szekeres-type functions, thus completely solving a problem of Fox, Pach, Sudakov, and Suk [Proc. Lond. Math. Soc. 105 (2012), 953--982].

Recommendations

• Bounds for the number of multidimensional partitions
• On the multi-dimensional partitions of small integers
• Partition problems in high dimensional boxes
• scientific article; zbMATH DE number 1998302
• An upper bound on the number of high-dimensional permutations

Cites work

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

Cited in

(3)

• Bounds for the number of multidimensional partitions
• Dedekind's problem in the hypergrid
• Note on the number of antichains in generalizations of the Boolean lattice

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

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