English
Related papers

Related papers: Additive double character sums over some structure…

200 papers

We show that a double character sum, appearing in the work of Conrey-Iwaniec and Petrow-Young on Weyl bound for certain $L$-functions, is essentially a hypergeometric sum introduced by Katz. This produces a simple proof of the upper bound…

Number Theory · Mathematics 2023-03-01 Ping Xi

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

Number Theory · Mathematics 2012-10-31 Gary L. Mullen , Daqing Wan , Qiang Wang

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

Representation Theory · Mathematics 2013-10-15 Mikhail V. Ignatyev

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

A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order.…

Number Theory · Mathematics 2012-05-18 Leo Goldmakher , Youness Lamzouri

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

The applications of additive codes mainly lie in quantum error correction and quantum computing. Due to their applications in quantum codes, additive codes have grown in importance. In addition to this, additive codes allow the…

Information Theory · Computer Science 2024-01-03 Astha Agrawal , R. K. Sharma

In this article, we investigate conditional large values of quadratic Dirichlet character sums with multiplicative coefficients. We prove some Omega results under the assumption of the generalized Riemann hypothesis.

Number Theory · Mathematics 2025-09-25 Zikang Dong , Yutong Song , Weijia Wang , Hao Zhang , Shengbo Zhao

Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…

Combinatorics · Mathematics 2021-05-20 Pepijn Wissing , Edwin R. van Dam

We establish a new bound for short character sums in finite fields, particularly over two-dimensional grids in $\mathbb{F}_{p^3}$ and higher-dimensional lattices in $\mathbb{F}_{p^d}$, extending an earlier work of Mei-Chu Chang on Burgess…

Number Theory · Mathematics 2025-11-11 Aishik Chattopadhyay

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

Representation Theory · Mathematics 2020-02-19 Robert M. Guralnick , Michael Larsen , Pham Huu Tiep

In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…

Representation Theory · Mathematics 2024-06-11 Arvind Ayyer , Hiranya Kishore Dey , Digjoy Paul

In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…

Combinatorics · Mathematics 2025-10-31 Kunle Adegoke , Robert Frontczak , Karol Gryszka

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

We derive explicit expressions for the sum rules of the eigenvalues of inhomogeneous strings with arbitrary density and with different boundary conditions. We show that the sum rule of order $N$ may be obtained in terms of a diagrammatic…

Mathematical Physics · Physics 2015-06-15 Paolo Amore

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…

Dynamical Systems · Mathematics 2024-09-18 Muhammad Mubarak , Tanja I. Schindler

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Combinatorics · Mathematics 2016-11-08 David Cushing , G. W. Stagg

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis