Efficient congruencing in ellipsephic sets: the general case

DOI10.1142/S1793042123500070MaRDI QIDQ5877912zbMATH OpenOpenAlexWikidataFDO

Authors Kirsti D. Biggs

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

zbMATH Keywords

efficient congruencingHardy-Littlewood methodmissing digits

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Counting solutions of Diophantine equations (11D45) Estimates on exponential sums (11L07) Applications of the Hardy-Littlewood method (11P55)

Recommendations

• Efficient congruencing in ellipsephic sets: the quadratic case
• Vinogradov systems with a slice off
• Paucity problems and some relatives of Vinogradov’s mean value theorem
• scientific article; zbMATH DE number 3265057
• scientific article; zbMATH DE number 726891
• scientific article; zbMATH DE number 3758461
• Near-optimal mean value estimates for multidimensional Weyl sums
• scientific article; zbMATH DE number 817579
• The number of integer points on Vinogradov's quadric
• Solutions to diagonal congruences with variables restricted to a box

Cites work

• Efficient congruencing in ellipsephic sets: the quadratic case
• Maximal operators and differentiation theorems for sparse sets
• Nested efficient congruencing and relatives of Vinogradov's mean value theorem
• Note on Hypothesis K of Hardy and Littlewood
• On a refinement of Waring's problem
• 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
• Sum of digits and distribution in congruence classes for palindromes with missing digits
• The cubic case of the main conjecture in Vinogradov's mean value theorem

Cited in

(9)

• Sharp bounds for the cubic Parsell-Vinogradov system in two dimensions
• Near-optimal mean value estimates for multidimensional Weyl sums
• Efficient congruencing in ellipsephic sets: the quadratic case
• Bounds on 10th moments of (𝑥,𝑥³) for ellipsephic sets
• Character sums over sparse elements of finite fields
• Weyl sums over integers with digital restrictions
• Sums of proper divisors with missing digits
• Kempner-like Harmonic Series
• Waring's problem with restricted digits

This page was built for publication: Efficient congruencing in ellipsephic sets: the general case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5877912)