Multiple representations in difference sets under polynomial density constraints
math.NT, math.CO
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Motivated by the classical study of additive representation functions and the combinatorial phenomenon of sum-difference asymmetry, we investigate the subtractive representation function d B…
Abstract
Motivated by the classical study of additive representation functions and the combinatorial phenomenon of sum-difference asymmetry, we investigate the subtractive representation function d B, A(n), which counts the number of solutions of the equation n = b - a with a in A and b in B. Specifically, we study lower bounds and the asymptotic behavior of d B, A(n) under polynomial density constraints of orders x α and x 1-α, where 0 < α< 1. We first establish a general lower bound for the first moment of d B, A(n). Furthermore, by employing a recursive construction, we prove that this lower bound is essentially optimal under certain regularity assumptions on the counting functions. Finally, utilizing probabilistic methods, we show the existence of sets for which d B, A(n) has a logarithmic point-wise upper bound.
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b