Efficient congruencing in ellipsephic sets: the general case
From MaRDI portal
Publication:5877912
DOI10.1142/S1793042123500070OpenAlexW2996528335WikidataQ114071766 ScholiaQ114071766MaRDI QIDQ5877912
Publication date: 16 February 2023
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.04351
Estimates on exponential sums (11L07) Applications of the Hardy-Littlewood method (11P55) Counting solutions of Diophantine equations (11D45) Radix representation; digital problems (11A63)
Related Items
Character sums over sparse elements of finite fields ⋮ Weyl sums over integers with digital restrictions
Cites Work
- The cubic case of the main conjecture in Vinogradov's mean value theorem
- On integers with missing digits: sum of digits and distribution in congruence classes
- Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three
- Maximal operators and differentiation theorems for sparse sets
- Sum of digits and distribution in congruence classes for palindromes with missing digits
- On a refinement of Waring's problem
- Efficient congruencing in ellipsephic sets: the quadratic case
- Nested efficient congruencing and relatives of Vinogradov's mean value theorem
- Note on Hypothesis K of Hardy and Littlewood