On some generalisations of the Erdos distance problem over finite fields

Igor E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

We use exponential sums to obtain new lower bounds on the number of distinct distances defined by all pairs of points (a, b) ∈ A × B for two given sets A, B ⊆ double-struck F sign⊆qn where double-struck F signq is a finite field of g elements and n ≥ 1 is an integer. Copyright Clearance Centre, Inc.

Original languageEnglish
Pages (from-to)285-292
Number of pages8
JournalBulletin of the Australian Mathematical Society
Volume73
Issue number2
DOIs
Publication statusPublished - Apr 2006

Fingerprint Dive into the research topics of 'On some generalisations of the Erdos distance problem over finite fields'. Together they form a unique fingerprint.

Cite this