On some generalisations of the Erdos distance problem over finite fields

Igor E. Shparlinski

doi:10.1017/S0004972700038867

On some generalisations of the Erdos distance problem over finite fields

Igor E. Shparlinski^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-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⊆_qⁿ where double-struck F sign_q is a finite field of g elements and n ≥ 1 is an integer. Copyright Clearance Centre, Inc.

Original language	English
Pages (from-to)	285-292
Number of pages	8
Journal	Bulletin of the Australian Mathematical Society
Volume	73
Issue number	2
DOIs	https://doi.org/10.1017/S0004972700038867
Publication status	Published - Apr 2006

Access to Document

10.1017/S0004972700038867

Cite this

@article{750c6c9f2f4c4769adc374f935ea1e14,

title = "On some generalisations of the Erdos distance problem over finite fields",

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.",

author = "Shparlinski, {Igor E.}",

year = "2006",

month = apr,

doi = "10.1017/S0004972700038867",

language = "English",

volume = "73",

pages = "285--292",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press (CUP)",

number = "2",

}

TY - JOUR

T1 - On some generalisations of the Erdos distance problem over finite fields

AU - Shparlinski, Igor E.

PY - 2006/4

Y1 - 2006/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646435081&partnerID=8YFLogxK

U2 - 10.1017/S0004972700038867

DO - 10.1017/S0004972700038867

M3 - Article

AN - SCOPUS:33646435081

SN - 0004-9727

VL - 73

SP - 285

EP - 292

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

IS - 2

ER -

On some generalisations of the Erdos distance problem over finite fields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this