English
Related papers

Related papers: On Some Multiple Character Sums

200 papers

We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[\alpha n + \beta] : n =1,2,... \}$, where $\alpha,\beta\in\R$, and $\alpha$ is irrational. Our bounds are nontrivial over the same short…

Number Theory · Mathematics 2007-05-23 William D. Banks , Igor E. Shparlinski

We say that a set $S$ is additively decomposed into two sets $A$ and $B$, if $S = \{a+b : a\in A, \ b \in B\}$. Here we study additively decompositions of multiplicative subgroups of finite fields. In particular, we give some improvements…

Number Theory · Mathematics 2013-01-15 Igor Shparlinski

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

Number Theory · Mathematics 2025-05-16 Kunle Adegoke , Robert Frontczak

We prove a stratification result for certain families of $n$-dimensional (complete algebraic) multiplicative character sums. The character sums we consider are sums of products of $r$ multiplicative characters evaluated at rational…

Number Theory · Mathematics 2017-09-07 Junyan Xu

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…

Number Theory · Mathematics 2021-05-07 Lucas Reis , Qiang Wang

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

Number Theory · Mathematics 2019-03-26 Simon Macourt , Igor E. Shparlinski

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Yoonjin Lee , Qiang Wang

This article is an expanded version of the talk given by the first author at the conference "Exponential sums over finite fields and applications" (ETH, Z\"urich, November, 2010). We state some conjectures on archimedian and $p$-adic…

Number Theory · Mathematics 2011-03-30 Alan Adolphson , Steven Sperber

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

Number Theory · Mathematics 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

The authors review results implicit in their recent paper [2] on the product/quotient representation of rationals by rationals of the type $( an + b )/ ( An+ B )$ and give a detailed account of a particular related non-intuitive…

Number Theory · Mathematics 2019-09-06 P. D. T. A. Elliott , Jonathan Kish

We study large values of quadratic character sums with summation lengths exceeding the square root of the modulus. Assuming the Generalized Riemann Hypothesis, we obtain a new Omega result.

Number Theory · Mathematics 2026-01-01 Zikang Dong , Ruihua Wang , Weijia Wang , Hao Zhang

We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…

Dynamical Systems · Mathematics 2025-10-16 Luke Hetzel

Let $p$ be a prime number, $\mathbb{F}_{p^n}$ be the finite field of order $p^n$, and $\{\omega_1,\ldots\omega_n\}$ be a basis of $\mathbb{F}_{p^n}$ over $\mathbb{F}_p$. Let, further, $N_i,H_i$ be integers such that $1\leq H_i\leq p$,…

Number Theory · Mathematics 2018-06-14 Mikhail Gabdullin

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

Group Theory · Mathematics 2013-09-17 Attila Maroti , Hung Ngoc Nguyen

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

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

Combinatorics · Mathematics 2025-04-02 Kunle Adegoke , Robert Frontczak , Karol Gryszka

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

Classical Analysis and ODEs · Mathematics 2007-05-23 Peng Gao

We prove that Burgess's bound gives an estimate not just for a single character sum, but for a mean value of many such sums.

Number Theory · Mathematics 2012-05-09 Roger Heath-Brown

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

Combinatorics · Mathematics 2016-12-13 Mathias Pétréolle

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