NOTICE: this is the author's version of a work that was accepted for publication in Indagationes Mathematicae. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Indagationes Mathematicae, Volume 12, Issue 3, (2001), Pages 303-315. doi:10.1016/S0019-3577(01)80012-4. http://www.elsevier.com/locate/indagLet IFp be the finite field with p elements, and let F(X) ∈ IFp[X] be a square-free polynomial. We show that in the ring R = IFp[X]/F(X), the inverses of polynomials of small hei...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of...
We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X]...
AbstractLet be the finite field with p elements, and let F(X) ∈ be a square-free polynomial. We sh...
This is a preprint of an article published in the Canadian Journal of Mathematics, 55 (2003), pp.225...
n this paper we investigate the uniform distribution properties of polynomials in many variables and...
This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2015, Springer-...
This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-V...
International audienceHooley proved that if f ∈ Z[X] is irreducible of degree ≥ 2, then the fraction...
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of...
This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2551, Springer-...
AbstractLet Fq be a finite field and consider the polynomial ring Fq[X]. Let Q∈Fq[X]. A function f:F...
n this paper we investigate the uniform distribution properties of polynomials in many variables and...
This paper gives the first quantitative bounds for the inverse theorem for the Gowers $U^4$-norm ove...
In this paper we investigate the uniform distribution properties of polynomials in many variables an...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of...
We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X]...
AbstractLet be the finite field with p elements, and let F(X) ∈ be a square-free polynomial. We sh...
This is a preprint of an article published in the Canadian Journal of Mathematics, 55 (2003), pp.225...
n this paper we investigate the uniform distribution properties of polynomials in many variables and...
This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2015, Springer-...
This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-V...
International audienceHooley proved that if f ∈ Z[X] is irreducible of degree ≥ 2, then the fraction...
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of...
This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2551, Springer-...
AbstractLet Fq be a finite field and consider the polynomial ring Fq[X]. Let Q∈Fq[X]. A function f:F...
n this paper we investigate the uniform distribution properties of polynomials in many variables and...
This paper gives the first quantitative bounds for the inverse theorem for the Gowers $U^4$-norm ove...
In this paper we investigate the uniform distribution properties of polynomials in many variables an...
Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let P...
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of...
We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X]...