English
Related papers

Related papers: Character sums over elements of extensions of fini…

200 papers

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…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

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…

Number Theory · Mathematics 2022-11-17 László Mérai , Igor E. Shparlinski , Arne Winterhof

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…

Number Theory · Mathematics 2017-04-12 Ilya D. Shkredov , Igor E. Shparlinski

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

Number Theory · Mathematics 2014-12-30 Igor E Shparlinski , Katherine E. Stange

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…

Number Theory · Mathematics 2015-07-06 Daqing Wan , Qiang Wang

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$.

Number Theory · Mathematics 2014-03-12 Jean Bourgain , Sergei Konyagin , Igor Shparlinski

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

Let $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…

Number Theory · Mathematics 2025-12-23 Rena Chu

In this paper, we study the sum of additive characters over finite fields, with a focus on those of specified \(\mathbb{F}_q\)-Order. We establish a general formula for these character sums, providing an additive analogue to classical…

Number Theory · Mathematics 2025-10-14 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P

This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.

Number Theory · Mathematics 2015-06-12 D. R. Heath-Brown , L. B. Pierce

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

Number Theory · Mathematics 2019-08-15 Brandon Hanson

We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…

Number Theory · Mathematics 2020-11-30 Cathy Swaenepoel , Arne Winterhof

We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.

Number Theory · Mathematics 2013-02-05 Xuancheng Shao

Given a finite field $\mathbb F_q$, a positive integer $n$ and an $\mathbb F_q$-affine space $\mathcal A\subseteq \mathbb F_{q^n}$, we provide a new bound on the sum $\sum_{a\in \mathcal A}\chi(a)$, where $\chi$ a multiplicative character…

Number Theory · Mathematics 2020-07-10 Lucas Reis

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…

Number Theory · Mathematics 2014-10-15 Bryce Kerr

Let $f$ be a complex valued function on a finite field $F$ such that $f(0) = 0$, $f(1) = 1$, and $|f(x)| = 1$ for $x \neq 0$. Cohn asked if it follows that $f$ is a nontrivial multiplicative character provided that $\sum_{x \in F} f(x)…

Number Theory · Mathematics 2007-05-23 Par Kurlberg

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

Number Theory · Mathematics 2019-02-20 Igor Shparlinski

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

General Mathematics · Mathematics 2012-05-25 N. A. Carella

Let $q$ be a prime power and $r$ a positive even integer. Let $\mathbb{F}_{q}$ be the finite field with $q$ elements and $\mathbb{F}_{q^r}$ be its extension field of degree $r$. Let $\chi$ be a nontrivial multiplicative character of…

Number Theory · Mathematics 2025-05-12 Kaimin Cheng , Arne Winterhof
‹ Prev 1 2 3 10 Next ›