2000 character limit reached
Solving equations in dense Sidon sets
Published 7 May 2020 in math.CO and math.NT | (2005.03484v2)
Abstract: We offer an alternative proof of a result of Conlon, Fox, Sudakov and Zhao on solving translation-invariant linear equations in dense Sidon sets. Our proof generalises to equations in more than five variables and yields effective bounds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.