On the number of high-dimensional partitions

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY(2024)

引用 0|浏览2
暂无评分
摘要
Let P-d(n) denote the number of n x center dot center dot center dot x n d-dimensional partitions with entries from {0,1, center dot center dot center dot, n}. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when d -> infinity, P-d(n)=2((1+od(1))) root 6/(d+1)pi-n(d) holds for all n >= 1. This makes progress towards 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 Erdos-Szekeres-type functions, thus solving a problem of Fox, Pach, Sudakov, and Suk [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.
更多
查看译文
关键词
high-dimensional
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要