Related papers: Weil sums of binomials: properties, applications, …

Let $F$ be a finite field, $\mu$ be a fixed additive character and $s$ be an integer coprime to $|F^\times|$. For any $a\in F$, the corresponding Weil sum is defined to be $W_{F,s}(a)=\displaystyle\sum_{x \in F} \mu(x^s-ax)$. The Weil…

We investigate the $p$-adic valuation of Weil sums of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d -a x)$, where $F$ is a finite field of characteristic $p$, $\psi$ is the canonical additive character of $F$, the exponent $d$ is relatively…

The Weil sum $W_{K,d}(a)=\sum_{x \in K} \psi(x^d + a x)$ where $K$ is a finite field, $\psi$ is an additive character of $K$, $d$ is coprime to $|K^\times|$, and $a \in K^\times$ arises often in number-theoretic calculations, and in…

We investigate the rationality of Weil sums of binomials of the form $W^{K,s}_u=\sum_{x \in K} \psi(x^s - u x)$, where $K$ is a finite field whose canonical additive character is $\psi$, and where $u$ is an element of $K^{\times}$ and $s$…

We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we…

Consider the Weil sum $W_{F,d}(u)=\sum_{x \in F} \psi(x^d+u x)$, where $F$ is a finite field of characteristic $p$, $\psi$ is the canonical additive character of $F$, $d$ is coprime to $|F^*|$, and $u \in F^*$. We say that $W_{F,d}(u)$ is…

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

In this paper, we investigate Weil polynomials and their relationship with isogeny classes of abelian varieties over finite fields. We give a necessary condition for a degree 12 polynomial with integer coefficients to be a Weil polynomial.…

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

We find all irreducible constituents of the Weil representation of a unitary group $U_m(A)$ of rank $m$ associated to a ramified quadratic extension $A$ of a finite, commutative, local and principal ring $R$ of odd characteristic. We show…