2000 character limit reached
On the Erdős-Falconer distance problem for two sets of different size in vector spaces over finite fields
Published 16 Oct 2011 in math.NT and math.CO | (1110.3502v2)
Abstract: We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
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.