Related papers: Further improvement on index bounds
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 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…
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…
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…
We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…
Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterl\'e for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds,…
We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
For Artin-Schreier curve y^q -y = f(x) defined over a finite field F_q of q elements, we show that the Weil bound for the number of the rational points over extension fields of F_q can often be greatly improved, essentially removing an…
In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…
The Hasse-Weil bound is a deep result in mathematics and has found wide applications in mathematics, theoretical computer science, information theory etc. In general, the bound is tight and cannot be improved. However, for some special…
We present a survey on Weil sums in which an additive character of a finite field $F$ is applied to a binomial whose individual terms (monomials) become permutations of $F$ when regarded as functions. Then we indicate how these Weil sums…
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 use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…