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...
Κύριοι συγγραφείς: | Ford, K, Green, B, Koukoulopoulos, D |
---|---|
Μορφή: | Journal article |
Γλώσσα: | English |
Έκδοση: |
Springer
2023
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
On a Sum Involving the Sum-of-Divisors Function
ανά: Feng Zhao, κ.ά.
Έκδοση: (2021-01-01) -
On the sum of positive divisors functions
ανά: Erban, R, κ.ά.
Έκδοση: (2021) -
On the divisor sums in arithmetical progressions
ανά: Eugenijus Stankus
Έκδοση: (1998-12-01) -
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
ανά: M. Haris Mateen, κ.ά.
Έκδοση: (2022-01-01) -
Moments of zeta and correlations of divisor-sums: V
ανά: Conrey, B, κ.ά.
Έκδοση: (2018)