Related papers: Character Sums and Deterministic Polynomial Root F…

The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

We study the sum of the squares of the irreducible character degrees not divisible by some prime $p$, and its relationship with the the corresponding quantity in a $p$-Sylow normalizer. This leads to study a recent conjecture by E.…

Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…

In this article, we study extreme values of quadratic character sums with multiplicative coefficients $\sum_{n \le N}f(n)\chi_d(n)$. For a positive number $N$ within a suitable range, we employ the resonance method to establish a…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

We obtain explicit factorizations of reduced period polynomials of degree $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. This extends the results of G. Myerson, who considered the cases $m=1$ and $m=2$, and…

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

In this note we extend some of the results of a previous paper \url{arXiv:math/0511593} to algebraically closed fields of finite characteristic. In particular, we show that there is an explicit expression in $n$ and $d$ which is divisible…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…