Add to ORKGAbstract. We study the problem of finding or estimating the smallest num-ber of summands needed to express each element of a fixed finite field as sum of values of a Dickson polynomial. We study the existence problem and prove several bounds using results from additive number theory and bounds on ad-ditive character sums. 1
In this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finite fields...
Let n be a positive integer, q=2n, and let Fq be the finite field with q elements. For each positive...
AbstractIn this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finit...
We extend recent results of Gomez and Winterhof, and Ostafe and Shparlinski on the Waring problem wi...
We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prim...
Arne Winterhof (Braunschweig) 1. Introduction. Let g(k, pn) be the smallest s such that every elemen...
Abstract. Let 픽 푞 [푡] denote the ring of polynomials over the finite field 픽 푞 of characteristic 푝, ...
In this thesis we present a number of character sum estimates for sums ofvarious types occurring in ...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
In this thesis we present a number of character sum estimates for sums ofvarious types occurring in ...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
The purpose of this paper is to extend results of Stepanov (1980; 1994) about lower bounds for incom...
International audienceWe define and study certain sum of digits function in the context of finite fi...
AbstractWe give new descriptions of the factors of Dickson polynomials over finite fields
AbstractWe derive the factorizations of the Dickson polynomialsDn(X,a) andEn(X,a), and of the bivari...
In this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finite fields...
Let n be a positive integer, q=2n, and let Fq be the finite field with q elements. For each positive...
AbstractIn this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finit...
We extend recent results of Gomez and Winterhof, and Ostafe and Shparlinski on the Waring problem wi...
We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prim...
Arne Winterhof (Braunschweig) 1. Introduction. Let g(k, pn) be the smallest s such that every elemen...
Abstract. Let 픽 푞 [푡] denote the ring of polynomials over the finite field 픽 푞 of characteristic 푝, ...
In this thesis we present a number of character sum estimates for sums ofvarious types occurring in ...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
In this thesis we present a number of character sum estimates for sums ofvarious types occurring in ...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
The purpose of this paper is to extend results of Stepanov (1980; 1994) about lower bounds for incom...
International audienceWe define and study certain sum of digits function in the context of finite fi...
AbstractWe give new descriptions of the factors of Dickson polynomials over finite fields
AbstractWe derive the factorizations of the Dickson polynomialsDn(X,a) andEn(X,a), and of the bivari...
In this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finite fields...
Let n be a positive integer, q=2n, and let Fq be the finite field with q elements. For each positive...
AbstractIn this paper we introduce the notion of Dickson polynomials of the (k+1)-th kind over finit...