English
Related papers

Related papers: Lower bounds on odd order character sums

200 papers

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

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

Representation Theory · Mathematics 2025-12-08 GyeongHyeon Nam , Anna Puskás

It is known that extreme characters of several inductive limits of compact groups exhibit multiplicativity in a certain sense. In the paper, we formulate such multiplicativity for inductive limit quantum groups and provide explicit examples…

Representation Theory · Mathematics 2023-10-06 Ryosuke Sato

Let f be a Hecke-Maass or holomorphic primitive cusp form for $SL(2,\mathbb{Z})$ with Fourier coefficients $\lambda_{f}(n)$. Let $\chi$ be a primitive Dirichlet character of modulus p, where p is a prime number. In this article we prove the…

Number Theory · Mathematics 2023-03-14 Aritra Ghosh

In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.

Combinatorics · Mathematics 2018-11-21 Daniele Bartoli , Matteo Bonini

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

Given a finite group $G$ and an irreducible complex character $\chi$ of $G$, the codegree of $\chi$ is defined as the integer ${\rm cod}(\chi)=|G:\ker\chi|/\chi(1)$. It was conjectured by G. Qian in [13] that, for every element $g$ of $G$,…

Group Theory · Mathematics 2023-06-16 Z. Akhlaghi , E. Pacifici , L. Sanus

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

Let $\chi$ be a quadratic Dirichlet character. In some literatures, various asymptotic formulae of $L'(1,\chi)$, under the assumption that $L(1,\chi)$ takes a small value, were derived. In this paper, we will give a new treatment unified…

Number Theory · Mathematics 2013-10-11 Luhao Yan

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Group Theory · Mathematics 2022-11-08 Abhijit Bhattacharjee

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

Group Theory · Mathematics 2022-08-17 Dongfang Yang , Yu Zeng , Heng Lv

We show how one can obtain rational approximants for $q$-extensions of the harmonic series and the logarithm (and many other similar quantities) by Pad\'e approximation using little $q$-Legendre polynomials and we show that properties of…

Classical Analysis and ODEs · Mathematics 2013-10-04 Walter Van Assche

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

Number Theory · Mathematics 2015-06-08 Marc Munsch , Igor E. Shparlinski

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

Discrete Mathematics · Computer Science 2026-03-03 Eitatsu Tomita , Tomohiro I

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 obtain a nontrivial bound on the number of solutions to the equation $$ A^{x_1} + \ldots + A^{x_\nu} = A^{x_{\nu+1}} + \ldots + A^{x_{2\nu}}, \quad 1 \le x_1, \ldots,x_{2\nu} \le \tau, $$ with a fixed $n\times n$ matrix $A$ over a finite…

Number Theory · Mathematics 2021-10-22 Alina Ostafe , Igor E. Shparlinski , José Felipe Voloch

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

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

Number Theory · Mathematics 2016-11-15 Daniel Rabayev

In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…

Number Theory · Mathematics 2023-05-12 Jens Marklof , Matthew Welsh

For each nonprincipal Dirichlet character $\chi$, let $n_\chi$ be the least $n$ with $\chi(n) \notin \{0,1\}$. We show that as the average of $n_\chi$ over all nonprincipal characters $\chi$ modulo $q$ is $\ell(q) + o(1)$, where $\ell(q)$…

Number Theory · Mathematics 2014-02-26 Greg Martin , Paul Pollack