English
Related papers

Related papers: Character sums over affine spaces and applications

200 papers

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

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

Number Theory · Mathematics 2024-09-23 Barnabás Szabó

Let J be a finite-dimensional nilpotent algebra over a finite field F_q. We formulate a procedure for analysing characters of the group 1+J. In particular, we study characters of the group $U_n (q)$ of unipotent triangular $n\times n$…

Group Theory · Mathematics 2010-05-28 Anton Evseev

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the…

We prove that for any prime power $q\notin\{3,4,5\}$, the cubic extension $\mathbb{F}_{q^3}$ of the finite field $\mathbb{F}_q$ contains a primitive element $\xi$ such that $\xi+\xi^{-1}$ is also primitive, and…

Number Theory · Mathematics 2022-02-03 Andrew R. Booker , Stephen D. Cohen , Nicol Leong , Tim Trudgian

Let $D_n(1,x)$ be the $n$th reversed Dickson polynomial. The power sums $\sum_{a\in\Bbb F_q}D_n(1,a)^i$, $i=1,2$, have been determined recently. In this paper we give an evaluation of the sum $\sum_{a\in\Bbb F_q}D_n(1,a)^3$. This result…

Combinatorics · Mathematics 2011-04-04 Xiang-dong Hou

Let $\mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2, \ldots, a_k, b\in \mathbb{F}_q$. We investigate $N_{\mathbb{F}_q}(a_1, a_2, \ldots,a_k;b)$, the number of ordered solutions $(x_1, x_2, \ldots,x_k)\in\mathbb{F}_q^k$ of…

Number Theory · Mathematics 2020-06-09 Jiyou Li , Xiang Yu

Let $G(q)$ be a Chevalley group over a finite field $F_q$. By Lusztig's and Shoji's work, the problem of computing the values of the unipotent characters of $G(q)$ is solved, in principle, by the theory of character sheaves; one issue in…

Representation Theory · Mathematics 2017-11-27 Meinolf Geck

Let $\mathbb{F}_q$ be a finite field with $q$ elements, where $q$ is the power of an odd prime, and let $\mathrm{GSp}(2n, \mathbb{F}_q)$ and $\mathrm{GO}^{\pm}(2n, \mathbb{F}_q)$ denote the symplectic and orthogonal groups of similitudes…

Representation Theory · Mathematics 2009-08-18 C. Ryan Vinroot

Let $\mathbb{M}$ be the group of multiplicative characters of a finite field $\mathbb{F}$, and let $\mathbb{J}(\alpha, \beta)$ be the Jacobi sum, for $\alpha, \beta \in \mathbb{M}$. We observe that the function $\mathbb{J} \colon \mathbb{M}…

Number Theory · Mathematics 2024-11-25 Andrew Snowden

Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…

Information Theory · Computer Science 2020-12-16 Yansheng Wu , Qin Yue

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

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever…

Number Theory · Mathematics 2026-04-17 Aishik Chattopadhyay

Let $r$ be a positive divisor of $q-1$ and $f(x,y)$ a rational function of degree sum $d$ over $\mathbb{F}_q$ with some restrictions, where the degree sum of a rational function $f(x,y) = f_1(x,y)/f_2(x,y)$ is the sum of the degrees of…

Number Theory · Mathematics 2024-10-08 Soniya Takshak , Giorgos Kapetanakis , Rajendra Kumar Sharma

Let $q$ be a power of a prime and $\mathbb{F}_q$ the finite field consisting of $q$ elements. We prove explicit upper bounds on the number of incidences between lines and Cartesian products in $\mathbb{F}_q^2$. We also use our results on…

Combinatorics · Mathematics 2018-08-17 Ali Mohammadi

We establish three results dealing with the character varieties of finitely generated groups. The first two are concerned with the behavior of $\dim X_n(\Gamma)$ as a function of $n$, and the third addresses the problem of realizing a…

Group Theory · Mathematics 2013-08-14 Igor A. Rapinchuk

We prove that if $k$ is a positive integer then for every finite field $\mathbb{F}$ of cardinality $q\neq 2$ and for every positive integer $n$ such that $q^n>(k-1)^4$, every $n\times n$ matrix over $\mathbb{F}$ can be expressed as a sum of…

Rings and Algebras · Mathematics 2025-11-13 Simion Breaz

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

Number Theory · Mathematics 2024-05-02 Alexander P. Mangerel , Yichen You

Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…

Number Theory · Mathematics 2021-02-16 Michele Elia
‹ Prev 1 3 4 5 6 7 10 Next ›