Journal article icon

Journal article

Equal sums in random sets and the concentration of divisors

Abstract:
We study the extent to which divisors of a typical integer n are concentrated. In particular, defining Ξ”(𝑛):=max𝑑#{𝑑|𝑛,logπ‘‘βˆˆ[𝑑,𝑑+1]}, we show that Ξ”(𝑛)β©Ύ(loglog𝑛)0.35332277… for almost all n, a bound we believe to be sharp. This disproves a conjecture of Maier and Tenenbaum. We also prove analogs for the concentration of divisors of a random permutation and of a random polynomial over a finite field. Most of the paper is devoted to a study of the following much more combinatorial problem of independent interest. Pick a random set π€βŠ‚β„• by selecting i to lie in 𝐀 with probability 1/i. What is the supremum of all exponents π›½π‘˜ such that, almost surely as π·β†’βˆž, some integer is the sum of elements of π€βˆ©[π·π›½π‘˜,𝐷] in k different ways? We characterise π›½π‘˜ as the solution to a certain optimisation problem over measures on the discrete cube {0,1}π‘˜, and obtain lower bounds for π›½π‘˜ which we believe to be asymptotically sharp.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1007/s00222-022-01177-y

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Magdalen College
Role:
Author
ORCID:
0000-0002-2224-1193


Publisher:
Springer
Journal:
Inventiones Mathematicae More from this journal
Volume:
232
Issue:
3
Pages:
1027-1160
Publication date:
2023-03-29
Acceptance date:
2022-12-09
DOI:
EISSN:
1432-1297
ISSN:
0020-9910


Language:
English
Keywords:
Pubs id:
1039004
Local pid:
pubs:1039004
Deposit date:
2023-03-03
ARK identifier:

Terms of use


Views and Downloads

Views and downloads will return soon






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP