On some applications of GCD sums to arithmetic combinatorics

DOI10.1016/J.JNT.2021.05.011zbMath1493.11029arXiv2010.03020OpenAlexW3169338860WikidataQ114156940 ScholiaQ114156940MaRDI QIDQ2239164

Ilya D. Shkredov

Publication date: 3 November 2021

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.03020

zbMATH Keywords

GCD sumsarithmetic combinatoricssum-product

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (1)

Some remarks on the asymmetric sum-product phenomenon

Cites Work

• Unnamed Item
• Unnamed Item
• Refinements of Gál's theorem and applications
• Energies and structure of additive sets
• Bounding multiplicative energy by the sumset
• On the Bogolyubov-Ruzsa lemma
• Higher convexity and iterated second moment estimates
• On iterated product sets with shifts. II
• GCD sums and sum-product estimates
• Large greatest common divisor sums and extreme values of the Riemann zeta function
• Expanders with superquadratic growth
• Some remarks on the asymmetric sum-product phenomenon
• Topics in multiplicative number theory
• The least quadratic non residue
• On Character Sums and Primitive Roots^†
• The structure theory of set addition revisited
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• ON ITERATED PRODUCT SETS WITH SHIFTS

This page was built for publication: On some applications of GCD sums to arithmetic combinatorics