Perfect partitions of a random set of integers
Journal of Applied Probability · 06.04.2026 · 1-30
DOI: 10.1017/jpr.2026.10086 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Probability, online erschienen am 06.04.2026. Verfasst von Boris Pittel. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let $X_1,\ldots, X_n$ be independent integers distributed uniformly on [ M ], $M\ge 2$ . A partition S of [ n ] into $\nu$ non-empty subsets $S_1,\ldots, S_{\nu}$ is called perfect if all $\nu$ values $\sum_{j\in S_{\alpha}}X_j$ are equal. For a perfect partition to exist, $\sum_j X_j$ has to be divisible by $\nu$ . In 2001, for $\nu=2$ , Christian Borgs, Jennifer Chayes, and the author proved that, conditioned on $\sum_j X_j$ being even, with high probability a perfect partition exists if $\kappa\;:\!=\; \lim {{n}/{\log M}}>{{1}/{\log 2}}$ , and that with high probability no perfect partition exists if $\kappa
Zitieren
APA
Pittel, B. (2026). Perfect partitions of a random set of integers. Journal of Applied Probability, 1-30. https://doi.org/10.1017/jpr.2026.10086
Vancouver
Pittel B. Perfect partitions of a random set of integers. Journal of Applied Probability. 2026:1-30. doi:10.1017/jpr.2026.10086
BibTeX
@article{Pittel2026,
author = {Pittel, Boris},
title = {Perfect partitions of a random set of integers},
journal = {Journal of Applied Probability},
year = {2026},
pages = {1--30},
doi = {10.1017/jpr.2026.10086}
}
EUVIMED