English
Related papers

Related papers: Double Character Sums over Subgroups and Intervals

200 papers

Let $p$ be an odd prime. Define the Gaussian power sum \[ G_n(p)=\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}(a+bi)^n\in\mathbb Z[i]. \] We determine $G_p(p)$ modulo high powers of $p$: if $p\equiv 1\pmod 4$ then $$G_p(p)\equiv p^2(1+i)\pmod{p^3},$$…

General Mathematics · Mathematics 2026-02-04 Nikita Kalinin , Faith Shadow Zottor

Let G be a p-solvable group, P a p-subgroup and chi in Irr(G) such that chi(1)_p \ge |G:P|_p. We prove that the restriction chi_P is a sum of characters induced from subgroups Q\le P such that chi(1)_p=|G:Q|_p. This generalizes previous…

Representation Theory · Mathematics 2021-07-23 Damiano Rossi , Benjamin Sambale

We establish various upper bounds on Type-I and Type-II shifted bilinear sums with Sali\'e sums modulo a large prime $q$. We use these bounds to study, for fixed integers $a,b\not \equiv 0 \bmod q$, the distribution ofsolutions to the…

Number Theory · Mathematics 2026-01-16 Igor E. Shparlinski , Yixiu Xiao

Let $G$ be a finite group of odd order. We show that if $\chi$ is an irreducible primitive character of $G$ then for all primes $p$ dividing the order of $G$ there is a conjugacy class such that the $p-$part of $\chi(1)$ divides the size of…

Group Theory · Mathematics 2019-06-27 Claudio Marchi

We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…

Probability · Mathematics 2026-04-27 Stephen Jordan Harrison

Let p be a prime number. Let G be a finite p-group and $\chi \in Irr(G)$. Denote by $\bar{\chi} \in Irr(G)$ the complex conjugate of $\chi$. Assume that $\chi(1)=p^n$. We show that the number of distinct irreducible constituents of the…

Group Theory · Mathematics 2007-05-23 Edith Adan-Bante

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

High Energy Physics - Theory · Physics 2015-06-12 C. Anzai , Y. Sumino

We prove that any multiplicative subgroup G of the prime field f_p with |G| < p^{1/2} satisfies |3G| \gg |G|^2 / \log |G|. Also, we obtain a bound for the multiplicative energy of any nonzero shift of G, namely E^* (G+x) \ll |G|^2 log |G|,…

Number Theory · Mathematics 2015-04-20 Ilya D. Shkredov

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

Group Theory · Mathematics 2017-07-14 Roman Bezrukavnikov , Martin W. Liebeck , Aner Shalev , Pham Huu Tiep

Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. Let $q_1<q_2$ denote the two smallest prime non-residues of $\chi$. We give explicit upper bounds on $q_2$ that improve upon all known results. We also provide a good…

Number Theory · Mathematics 2010-11-22 Kevin J. McGown

Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of irreducible characters of $G$. The codegree of an irreducible character $\chi$ of the group $G$ is defined as $\mathrm{cod}(\chi)=|G:\mathrm{ker}(\chi)|/\chi(1)$. In this paper,…

Group Theory · Mathematics 2021-05-18 Yang Liu , Yong Yang

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…

Group Theory · Mathematics 2019-05-24 William R. Unger

Let $\mathfrak{q}>2$ be a prime number, $\chi$ a primitive Dirichlet character modulo $\mathfrak{q}$ and $f$ a primitive holomorphic cusp form or a Hecke-Maass cusp form of level $\mathfrak{q}$ and trivial nebentypus. We prove the subconvex…

Number Theory · Mathematics 2020-05-19 Qingfeng Sun , Hui Wang

Let $p>7$ be a prime, let $G=\Z/p\Z$, and let $S_1=\prod_{i=1}^p g_i$ and $S_2=\prod_{i=1}^p h_i$ be two sequences with terms from $G$. Suppose that the maximum multiplicity of a term from either $S_1$ or $S_2$ is at most $\frac{2p+1}{5}$.…

Combinatorics · Mathematics 2007-10-22 David J. Grynkiewicz , Jujuan Zhuang

A multiple Gauss sum is a complete multiple exponential sum twisted by Dirichlet characters. We prove a new bound for multiple Gauss sums and, as an application, improve previous results in the Birch--Goldbach problem. Let $F_1, \ldots, F_R…

Number Theory · Mathematics 2026-05-19 Jianya Liu , Sizhe Xie

We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.

Number Theory · Mathematics 2020-04-07 Tomasz Schoen , Ilya D. Shkredov

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

Number Theory · Mathematics 2017-09-13 Kostadinka Lapkova

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

An explicit formula for the quadratic mean value at $s=1$ of the Dirichlet $L$-functions associated with the odd Dirichlet characters modulo $f>2$ is known. Here we present a situation where we could prove an explicit formula for the…

Number Theory · Mathematics 2024-06-06 Stéphane Louboutin