dorsal/arxiv
View SchemaA Hal\'asz-type theorem for permutation anticoncentration
| Authors | Zach Hunter, Cosmin Pohoata, Daniel G. Zhu |
|---|---|
| Categories | |
| ArXiv ID | 2601.06019vv1 |
| URL | https://arxiv.org/abs/2601.06019 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem of Pawlowski shows that as soon as the coefficients are not all equal, this distribution is always spread out at scale $n^{-1}$: no single value can occur with probability larger than $\frac{1}{2\lceil n/2\rceil + 1}$, and this bound is sharp in general. We show that stronger anticoncentration holds when the coefficients have additional diversity. We quantify the structure of the coefficient multiset by a simple statistic depending on its multiplicity profile, and prove that the maximum point mass of the permuted sum decays polynomially faster as this statistic grows. In particular, when the coefficients are all distinct we obtain a bound of $n^{-5/2+o(1)}$, which can be regarded as an analogue of a classical theorem of Erd\H{o}s and Moser.
{
"annotation_id": "7e334df7-bdd6-43a3-bcb1-d6b3d1021aac",
"date_created": "2026-02-17T05:53:04.722000Z",
"date_modified": "2026-02-17T05:53:04.722000Z",
"file_hash": "63195a8e1b6b2e435c0fde40568cedc2ddc98ce3db02dc203a204a3aa5b7f9d3",
"private": false,
"record": {
"abstract": "Given a set $A=\\{a_1,\\ldots,a_n\\}$ of real numbers and real coefficients $b_1,\\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$\u0027s with the $b_i$\u0027s according to a uniformly random permutation. A recent theorem of Pawlowski shows that as soon as the coefficients are not all equal, this distribution is always spread out at scale $n^{-1}$: no single value can occur with probability larger than $\\frac{1}{2\\lceil n/2\\rceil + 1}$, and this bound is sharp in general.\n We show that stronger anticoncentration holds when the coefficients have additional diversity. We quantify the structure of the coefficient multiset by a simple statistic depending on its multiplicity profile, and prove that the maximum point mass of the permuted sum decays polynomially faster as this statistic grows. In particular, when the coefficients are all distinct we obtain a bound of $n^{-5/2+o(1)}$, which can be regarded as an analogue of a classical theorem of Erd\\H{o}s and Moser.",
"arxiv_id": "2601.06019",
"authors": [
"Zach Hunter",
"Cosmin Pohoata",
"Daniel G. Zhu"
],
"categories": [
"math.CO",
"math.PR"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "A Hal\\\u0027asz-type theorem for permutation anticoncentration",
"url": "https://arxiv.org/abs/2601.06019",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "b371750e-9046-469a-ba30-f068b204ce03",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}