English
Related papers

Related papers: Explicit Burgess Bound for Composite Moduli

200 papers

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

Representation Theory · Mathematics 2019-10-10 Michael Hansen , Masanori Koyama , Matthew B. A. McDermott , Michael E. Orrison , Sarah Wolff

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

We give a formula to compute the dimension of the generic component of the moduli space of an irreducible germ of curve in the complex plane.

Dynamical Systems · Mathematics 2019-04-17 Yohann Genzmer

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

Representation Theory · Mathematics 2024-09-10 Paul Balmer , Dave Benson

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

In this article, we investigate conditional large values of quadratic Dirichlet character sums. We prove some Omega results of quadratic character sums under the assumption of the generalized Riemnn hypothesis, which are as sharp as…

Number Theory · Mathematics 2025-09-10 Zikang Dong , Yanbin Zhang

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for squarefree modulus. Given a primitive character $\chi$ to squarefree modulus $q$, we prove the following upper bound \begin{align*} \left|…

Number Theory · Mathematics 2019-09-04 Matteo Bordignon , Bryce Kerr

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

Number Theory · Mathematics 2026-04-06 Todd Cochrane , Andrew Granville

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 derive general expressions for the sum rules of the eigenvalues of drums of arbitrary shape and arbitrary density, obeying different boundary conditions. The formulas that we present are a generalization of the analogous formulas for one…

Mathematical Physics · Physics 2015-06-15 Paolo Amore

In this note we give a new bound for large sieve with characters to power moduli which improves in some range of the parameters the previous bounds of Baier/Zhao and Halupczok.

Number Theory · Mathematics 2019-10-22 Marc Munsch

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

Number Theory · Mathematics 2026-05-14 Néo Tardy

We prove a lower bound for the large sieve with square moduli.

Number Theory · Mathematics 2019-09-11 Stephan Baier , Sean B. Lynch , Liangyi Zhao

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

Number Theory · Mathematics 2017-06-20 Bryce Kerr

We prove a character sum identity for Coxeter arrangements which is a finite field analogue of Macdonald's conjecture proved by Opdam.

Algebraic Geometry · Mathematics 2007-12-06 J. Denef , F. Loeser

In the present paper, we generalize some of the results on Kloosterman sums proven in \cite{BG} for prime moduli to general moduli. This requires to establish the corresponding additive properties of the reciprocal set $$…

Number Theory · Mathematics 2013-09-05 J. Bourgain , M. Z. Garaev

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

Number Theory · Mathematics 2021-11-11 Igor E. Shparlinski

We find some general lower bounds of the sum of certain families of multigraded Betti numbers of any simplicial complex with a vertex coloring.

Algebraic Topology · Mathematics 2019-02-04 Li Yu

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

Representation Theory · Mathematics 2024-03-15 Michael Larsen , Pham Huu Tiep

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
‹ Prev 1 4 5 6 7 8 10 Next ›