Article contents
On some generalisations of the Erdős distance problem over finite fields
Published online by Cambridge University Press: 17 April 2009
Extract
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 where is a finite field of q elements and n ≥ 1 is an integer.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2006
References
- 5
- Cited by