Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2406.09360

Help | Advanced Search

Mathematics > Number Theory

arXiv:2406.09360 (math)
[Submitted on 13 Jun 2024 (v1) , last revised 25 Sep 2025 (this version, v4)]

Title: On Arratia's coupling and the Dirichlet law for the factors of a random integer

Title: 关于阿拉蒂亚耦合和随机整数因子的狄利克雷定律

Authors:Tony Haddad, Dimitris Koukoulopoulos
Abstract: Let $x \ge 2$, let $N_x$ be an integer chosen uniformly at random from the set $\mathbb Z \cap [1, x]$, and let $(V_1, V_2, \ldots)$ be a Poisson--Dirichlet process of parameter $1$. We prove that there exists a coupling of these two random objects such that $$ \mathbb E \, \sum_{i \ge 1} |\log P_i- V_i\log x| \asymp 1, $$ where the implied constants are absolute and $N_x = P_1P_2 \cdots$ is the unique factorization of $N_x$ into primes or ones with the $P_i$'s being non-increasing. This establishes a 2002 conjecture of Arratia arXiv:1305.0941 who constructed a coupling for which the left-hand side in the above estimate is $\ll \log\!\log x$, and who also proved that the left-hand side is $\ge 1-o(1)$ for all couplings. In addition, we use our refined coupling to give a probabilistic proof of the Dirichlet law for the average distribution of the integer factorization into $k$ parts proved in 2023 by Leung arXiv:2206.14728 and we improve on its error term.
Abstract: 设$x \ge 2$,令$N_x$从集合$\mathbb Z \cap [1, x]$中均匀随机选择一个整数,令$(V_1, V_2, \ldots)$为参数为$1$的泊松-狄利克雷过程。 我们证明存在这两个随机对象的耦合,使得$$ \mathbb E \, \sum_{i \ge 1} |\log P_i- V_i\log x| \asymp 1, $$,其中隐含的常数是绝对的,并且$N_x = P_1P_2 \cdots$是$N_x$的素数或1的唯一分解,其中$P_i$是非递增的。 这证实了 Arratia 在 2002 年提出的猜想 arXiv:1305.0941,他构造了一个耦合,使得上述估计中的左边是$\ll \log\!\log x$,他还证明了对于所有耦合,左边是$\ge 1-o(1)$。 此外,我们使用我们改进的耦合给出了整数分解为$k$部分的平均分布的 Dirichlet 定律的概率证明,该定律由 Leung 在 2023 年 arXiv:2206.14728 中证明,并我们改进了其误差项。
Comments: 37 pages, minor corrections. Final version, published in Journal de l'\'Ecole polytechnique -- Math\'ematiques
Subjects: Number Theory (math.NT) ; Probability (math.PR)
MSC classes: 11N25, 11N37, 11N60, 60B12
Cite as: arXiv:2406.09360 [math.NT]
  (or arXiv:2406.09360v4 [math.NT] for this version)
  https://doi.org/10.48550/arXiv.2406.09360
arXiv-issued DOI via DataCite
Journal reference: Journal de l'École polytechnique -- Mathématiques, Tome 12 (2025), pp. 1565-1604
Related DOI: https://doi.org/10.5802/jep.317
DOI(s) linking to related resources

Submission history

From: Tony Haddad [view email]
[v1] Thu, 13 Jun 2024 17:45:12 UTC (36 KB)
[v2] Thu, 4 Jul 2024 14:57:01 UTC (37 KB)
[v3] Fri, 14 Feb 2025 07:05:16 UTC (38 KB)
[v4] Thu, 25 Sep 2025 21:09:27 UTC (38 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math.NT
< prev   |   next >
new | recent | 2024-06
Change to browse by:
math
math.PR

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号