On the number of high-dimensional partitions

TL;DR

This paper establishes an asymptotic formula for the number of high-dimensional partitions as the dimension grows, advancing conjectures and connecting to Ramsey theory, with a new supersaturation theorem for antichains.

Contribution

It provides the first asymptotic enumeration of high-dimensional partitions for large dimensions, confirming a conjecture and solving a related Ramsey theoretic problem.

Findings

Asymptotic formula for $P_{d}(n)$ as $d o

Progress towards Moshkovitz-Shapira conjecture

Solution to a Ramsey parameter problem for antichains

Abstract

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to \infty$, $$P_{d}(n) = 2^{(1+o_{d}(1)) \sqrt{\frac{6}{(d+1)\pi}} \cdot n^{d}}$$ holds for all $n \geq 1$. This makes progress towards a conjecture of Moshkovitz-Shapira [{\it{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 Erd\H{o}s-Szekeres-type functions, thus solving a problem of Fox, Pach, Sudakov, and Suk [{\it{Proc. Lond. Math. Soc.}} 105 (2012), 953--982]. Our main result is a new supersaturation theorem for antichains in $[n]^{d}$, which may be of independent interest.