Equal sums in random sets and the concentration of divisors
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...
Egile Nagusiak: | Ford, K, Green, B, Koukoulopoulos, D |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
Springer
2023
|
Antzeko izenburuak
-
On a Sum Involving the Sum-of-Divisors Function
nork: Feng Zhao, et al.
Argitaratua: (2021-01-01) -
On the sum of positive divisors functions
nork: Erban, R, et al.
Argitaratua: (2021) -
On the divisor sums in arithmetical progressions
nork: Eugenijus Stankus
Argitaratua: (1998-12-01) -
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
nork: M. Haris Mateen, et al.
Argitaratua: (2022-01-01) -
Moments of zeta and correlations of divisor-sums: V
nork: Conrey, B, et al.
Argitaratua: (2018)