Sets whose differences avoid squares modulo 𝑚

DOI10.1090/proc/15511zbMath1497.11048arXiv2007.05774OpenAlexW3132641416MaRDI QIDQ5002534

Kevin Ford, Mikhail R. Gabdullin

Publication date: 28 July 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

additive number theoryprobabilistic number theory

Mathematics Subject Classification ID

Exponential sums (11T23) Sequences (mod (m)) (11B50) Power residues, reciprocity (11A15)

Cites Work

• Difference sets without squares
• On the number of restricted prime factors of an integer. I
• Difference sets without \(\kappa\)-th powers
• Mertens' theorem for arithmetic progressions
• An improved lower bound related to the Furstenberg-Sárközy theorem
• CLIQUE NUMBERS OF PALEY GRAPHS
• The distribution of quadratic residues and non‐residues
• The Voting Problem
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On the size of prime factors of integers
• On difference sets of sequences of integers. I
• Sets in $ {\mathbb{Z}}_m$ whose difference sets avoid squares
• On some Properties of Prime Factors of Integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sets whose differences avoid squares modulo 𝑚