2003
DOI: 10.4153/cjm-2003-010-0
|View full text |Cite
|
Sign up to set email alerts
|

Short Kloosterman Sums for Polynomials over Finite Fields

Abstract: Abstract. We extend to the setting of polynomials over a finite field certain estimates for short Kloosterman sums originally due to Karatsuba. Our estimates are then used to establish some uniformity of distribution results in the ring F q [x]/M(x) for collections of polynomials either of the form f −1 g −1 or of the form f −1 g −1 + a f g, where f and g are polynomials coprime to M and of very small degree relative to M, and a is an arbitrary polynomial. We also give estimates for short Kloosterman sums wher… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…This proof is quite similar to the proof of Theorem 2.2, and just requires slightly more attention to detail to obtain more explicit bounds. This expands upon some ideas from [6,14]. Again, recall the notation a 0 , r 0 and F 0 from (5.1).…”
Section: Applicationsmentioning
confidence: 86%
See 1 more Smart Citation
“…This proof is quite similar to the proof of Theorem 2.2, and just requires slightly more attention to detail to obtain more explicit bounds. This expands upon some ideas from [6,14]. Again, recall the notation a 0 , r 0 and F 0 from (5.1).…”
Section: Applicationsmentioning
confidence: 86%
“…As mentioned previously, bounds on sums of this form are used as tools to establish some of the main results in [25]. Here we take a different approach to bounding these sums which can hold for arbitrary F , based on the ideas of Bourgain and Garaev [8], Garaev [14], Fouvry and Shparlinski [12], Banks, Harcharras and Shparlinski [6] and Irving [17].…”
Section: 1mentioning
confidence: 99%
“…It has been shown in [1] that using the method of [7,8] (see also [4]), one can obtain an analogue of Theorem 1 for polynomials G of the form G = G 1 G 2 where G 1 , G 2 are irreducible polynomials of very small degree; see also [2].…”
Section: Remarksmentioning
confidence: 99%