REVIEW 6 minor 1 cited by
Non-abelian amplification and bilinear forms with Kloosterman sums
T0 review · 0 major / 6 minor · reviewed 2026-08-03 · deepseek-v4-flash
Pith's one-line read By replacing abelian characters with a non-abelian amplifier on SL2(Z/cZ), this paper proves a power saving over the trivial bound for bilinear Kloosterman sums at square-root length for every composite modulus.
desk verdict A dense but genuine advance: new power savings for bilinear Kloosterman sums at composite moduli, with the counting lemma surviving close scrutiny; worth a serious referee. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central objects are the permutation representation rho_c of SL2(Z/cZ) on the projective line P1(Z/cZ), given by Möbius transformations, and its 'sifted' subrepresentation rho^o_c, obtained by removing all subrepresentations that factor through reduction mod d for d|c. A Kloosterman matrix is shown to have operator norm bounded by c times the spectral norm of a Fourier coefficient of a short-word function at rho^o_c. The new amplifier, Proposition 5.1, weights the sixth moment of singular values by a character sum over a normal congruence subgroup Gamma_c(d); this turns the problem into counting 6-tuples h1,...,h6 with |hi| at most H satisfying T^{h1} S ... T^{h6} S = I in PSL2(Z/dZ). The
What would settle it
Compute, for c=p^2 and H1=H2=p, the exact number of 6-tuples (h1,...,h6) in [-p,p]^6 satisfying T^{h1}S...T^{h6}S ≡ ±I mod p^2 or ≡ ±I mod p. Proposition 6.4 predicts at most p^{2+o(1)} and p^{3+o(1)} solutions respectively; finding p^{2+δ} or p^{3+δ} for a fixed δ>0 would invalidate the saving.
Extended reading notes
Core claim
Let c be any positive integer and let M,N not exceed c^{1/2+o(1)}. The paper proves that the bilinear sum of Kloosterman sums S(am,n;c) over m≤M, n≤N with (m,n,c)=1 is bounded by ||alpha|| ||beta|| c^{1-1/700+o(1)} for arbitrary complex sequences, and by sqrt(M) ||beta|| c^{1-1/276+o(1)} when the alpha coefficients are bounded by 1. This beats the trivial bound c^{1+o(1)} in the hardest balanced regime where MN is about c. The engine is Theorem 1.2: after writing c=dd'e with d'|d and (d,e)=1, the saving is governed by (f/min(c,d^2))^{1/6}, where f is the largest integer with f^2|cd. For c a square of a prime or a product of two primes of comparable size, this yields a c^{-1/12} saving, and c
Load-bearing premise
The power saving enters only through the elementary count of six-fold products T^{h1}S...T^{h6}S equal to the identity in PSL2(Z/cZ) (Proposition 6.4); if that count were larger than c^{o(1)}(H2^2 + (H1H2)^2/c), the main theorem's saving would fail.
Editorial extensions
If this is right
- For every composite modulus c, bilinear Kloosterman sums at length about sqrt(c) now admit a uniform power saving over the trivial bound, including the previously resistant cases p^2 and pq with comparable primes.
- For moduli such as p^2 or pq with comparable primes, the saving reaches c^{-1/12} in the balanced range, and the method beats the trivial bound for M,N between c^{5/12+o(1)} and c^{5/8-o(1)}.
- The averaged second moment of two twisted cuspidal L-functions over primitive characters mod q satisfies the predicted asymptotic with an error q^{1-1/674+o(1)} for every modulus q.
- For composite levels q with a divisor d of size sqrt(q) such that q/d is square-free, the exceptional-spectrum large sieve inequality holds with a factor q^{6θ/5}, improving on the standard q^θ loss when N is about sqrt(q).
- The non-abelian amplification lemma applies to arbitrary finite groups and normal subgroups, making the structure reusable for other exponential sums with SL2 or GL2 geometry.
Reading between the lines
- A natural stress test is the q=8 analogue of the counting bound: if the number of 8-tuples obeys Conjecture 6.2 in the range H roughly sqrt(c), the same framework would give nontrivial prime-modulus bounds for lengths beyond p^{3/8+o(1)}, a barrier that also appears in known results; the paper explicitly leaves this open.
- The exponents 1/700 and 1/276 are small because a sixth moment is used to control the top singular value; using a higher even moment or refining the character-size lower bound should improve the exponents without changing the mechanism.
- The same pattern—choose a large normal subgroup, amplify, then count solutions in PSL2(Z/dZ)—should also bound bilinear sums of other exponential sums with projective-line geometry, such as additive characters of Möbius transformations; the author notes this possibility but does not carry it out.
- The moment application is stated for holomorphic cusp forms; extending it to Maass cusp forms would require additional care about the Ramanujan bound, as the paper indicates, so a fully unconditional Maass-level version is not immediate.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a new method, based on non-abelian Fourier analysis and a non-abelian amplification argument, for bounding bilinear (Type II) sums of Kloosterman sums with composite moduli. The central result, Theorem 1.1, gives a power saving over the trivial bound c for sequences of length at most c^{1/2+o(1)} for every modulus, with exponents 1/700 in general and 1/276 when one sequence is bounded. The argument proceeds by realizing Kloosterman matrices as Fourier coefficients of a representation ρ_c^∘ of SL_2(Z/cZ), applying an amplifier supported on a congruence subgroup Γ_c(d), and reducing to an elementary count (Proposition 6.4) of solutions in PSL_2(Z/\tilde d Z). The paper also proves an asymptotic for twisted second moments of modular L-functions (Theorem 1.5) and an improved large sieve for exceptional Maass forms for composite levels (Theorem 9.4 / Corollary 1.6).
Significance. If the main results are correct, this is a substantial advance: it supplies the first nontrivial Type II Kloosterman bound at square-root length for the composite moduli (such as p^2 or pq) that were the remaining barriers for the moment application, and it does so with an explicit, self-contained method that avoids the algebraic-geometric machinery used in the prime-modulus results. The non-abelian amplifier construction is new and likely to be useful independently. A particularly valuable feature is that the power saving is produced by a purely elementary counting argument, with no fitted parameters or circular benchmarks; the savings are measured directly against the trivial bound (1.2), and external results are used only for the near-prime and prime-modulus cases. The paper also honestly acknowledges the simultaneous independent work [29]. The main risk is the intricacy of Proposition 6.4, the sole source of the saving; I checked the main danger points and found no counterexample, but the proof is delicate enough that a fully expanded verification of the endpoint maximization is desirable.
minor comments (6)
- [§6, Proposition 6.4, Case 2] In the sentence 'Since h5h6 ≡ 1 (mod d), there are O(1 + H1H2/c) ways to pick the nonzero integer h5h6', the denominator should be d, not c. The factor (1+H1H2/d) appears correctly in (6.8), but the displayed sentence is internally inconsistent and, read literally, would undercount the h5,h6 possibilities. Please correct and clarify.
- [§6, Eq. (6.8)] The transition from the bound after (6.8) to the final maximum is compressed. It is asserted that after expansion each term is monotone in d, so the maximum occurs at d=1 or d=c; however the displayed algebra also contains an inequality that should be ≤ rather than = when min(H1/(cd),1) is replaced by H1/(cd). Since Proposition 6.4 is the load-bearing combinatorial step, please spell out this maximization and the inequalities in full.
- [§6, proof of Proposition 6.4] In the sum over g in the estimation of the h2,h3 contribution, the congruence for h2' should be h2' ≡ g^{-1} r (mod d), not h2' ≡ gr (mod d). The resulting count is the same, but the displayed congruence is a typo that should be corrected.
- [§5, Proposition 5.1] The right-hand side of the amplifier inequality is written as a complex-valued sum involving χ(g1···gq). The proof shows that this quantity arises from a nonnegative expression, but the statement itself would benefit from a remark that the displayed sum is real (or that one takes its real part), to avoid an apparent type mismatch with the real left-hand side.
- [§1.2, Remark on [29]] The acknowledgment of simultaneous independent work is appropriate and should remain. It may be worth noting explicitly which results overlap and which remain unique to this paper, since the current remark is brief.
- [§A, Lemma 5.4] The remark after Lemma 5.4 states that the bound is expected to hold for all 0≤j≤k. As written, Proposition 5.3 uses only the proved range, so this is not a gap, but the reader would benefit from a sentence clarifying that the unproved extension is not needed for the main theorems.
Circularity Check
No significant circularity: the power saving comes from an independent counting lemma (Prop 6.4), not from the target bound.
full rationale
The central claim (Theorem 1.1) is not circular. The new saving is produced by Theorem 7.1, whose chain is: Proposition 4.10/Corollary 4.11 (exact reduction of a Kloosterman matrix to a Fourier coefficient on SL_2(Z/cZ) via Poisson summation and Möbius inversion), Proposition 5.5 (amplification passes to a weighted count of solutions in PSL_2(Z/dZ), using character bounds from Lemmas 5.2 and 5.4, whose proofs are local matrix/Clifford-theory computations), and Proposition 6.4 (an elementary count for q=6 solutions in PSL_2(Z/cZ), independent of the bilinear-form statement). None of these steps is a fitted parameter renamed as a prediction; the counting target (6.1) is structurally distinct from the desired bilinear bound, and no equation in the proof is equivalent by construction to the statement being proved. Section 9 cites the author's [32, Corollary I], but that is a prior large-sieve result derived from the Kuznetsov trace formula and Deshouillers--Iwaniec [11], not the theorem being established, and the core composite-modulus bilinear theorem does not rely on it. Near-prime cases use external results of Kowalski--Michel--Sawin [24] and Blomer--Milićević [3]. The remaining open Conjecture 6.2 is explicitly not used for q=6. Therefore no circular step is present.
Assumptions & free parameters
assumptions (6)
- standard math Weil bound for Kloosterman sums: |S(m,n;c)| ≪ c^{o(1)} sqrt((m,n,c)c) (Lemma 3.3)
- standard math Kowalski–Michel–Sawin bilinear-form bound for prime moduli (Theorem 3.4)
- standard math Blomer–Milićević bound for moduli with a large divisor (Theorem 3.5)
- standard math Deligne's bound on Hecke eigenvalues: λ_f(n) ≪ n^{o(1)} (8.2)
- standard math Bourgain–Gamburd dimension bound for primitive representations of SL2(Z/p^kZ) (Lemma 3.16)
- standard math Deshouillers–Iwaniec large sieve inequality (Theorem 9.3)
Cite this review
Pith. "Pith review of Non-abelian amplification and bilinear forms with Kloosterman sums." pith.science (2026). https://pith.science/paper/SMLZ4DYO
@misc{pith2026251108445,
author = {Pith},
title = {Pith review of: Non-abelian amplification and bilinear forms with Kloosterman sums},
year = {2026},
howpublished = {\url{https://pith.science/paper/SMLZ4DYO}},
note = {Machine review of arXiv:2511.08445}
}
abstract
We introduce a new method to bound bilinear (Type II) sums of Kloosterman sums with composite moduli $c$, using Fourier analysis on $\mathrm{SL}_2(\mathbb{Z}/c\mathbb{Z})$ and an amplification argument with non-abelian characters. For sums of length $\sqrt{c}$, our method produces a non-trivial bound for all moduli except near-primes, saving $c^{-1/12}$ for products of two primes of the same size. Combining this with previous results for prime moduli, we achieve savings beyond the P\'olya-Vinogradov range for all moduli. We give applications to moments of twisted cuspidal $L$-functions, and to large sieve inequalities for exceptional cusp forms with composite levels.
Forward citations
Cited by 1 Pith paper
-
Bilinear forms with Kloosterman sums via quadratic characters
Bilinear Kloosterman forms save c^{-1/32} at length √c for all moduli via a new link to quadratic character sums, improving prior prime and composite bounds.
Reference graph
Works this paper leans on
-
[29]
Bilinear forms with Kloosterman sums and moments of twisted L-functions
Djordje Milićević, Xinhua Qin, and Xiaosheng Wu. Bilinear forms with Kloosterman sums and moments of twisted L-functions. arXiv preprint, November 2025
2025
-
[1]
On moments of twisted L-functions
Valentin Blomer, Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, and Djordje Milićević. On moments of twisted L-functions. Amer. J. Math., 139(3):707–768, 2017
2017
-
[2]
The second moment theory of families ofL-functions—the case of twisted HeckeL-functions
Valentin Blomer, Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, Djordje Milićević, and Will Sawin. The second moment theory of families ofL-functions—the case of twisted HeckeL-functions. Mem. Amer. Math. Soc., 282(1394):v+148, 2023
2023
-
[3]
The second moment of twisted modularL-functions
Valentin Blomer and Djordje Milićević. The second moment of twisted modularL-functions. Geom. Funct. Anal., 25(2):453–516, 2015
2015
-
[4]
Friedlander, and Henryk Iwaniec
Enrico Bombieri, John B. Friedlander, and Henryk Iwaniec. Primes in arithmetic progressions to large moduli. Acta Math., 156(3-4):203–251, 1986
1986
-
[5]
Expansion and random walks inSLd(Z/pnZ)
Jean Bourgain and Alex Gamburd. Expansion and random walks inSLd(Z/pnZ). I.J. Eur. Math. Soc. (JEMS), 10(4):987–1011, 2008
2008
-
[6]
A. H. Clifford. Representations induced in an invariant subgroup.Ann. of Math. (2), 38(3):533–550, 1937
1937
-
[7]
Niveau de répartition des polynômes quadratiques et crible majorant pour les entiers friables.J
Régis de La Bretèche and Sary Drappeau. Niveau de répartition des polynômes quadratiques et crible majorant pour les entiers friables.J. Eur. Math. Soc., 22(5):1577–1624, 2020
2020
Show all 47 references
-
[8]
La conjecture de Weil
Pierre Deligne. La conjecture de Weil. I.Inst. Hautes Études Sci. Publ. Math., (43):273–307, 1974
1974
-
[9]
Mathematika, 29(2):202–212, 1982
J.-M.DeshouillersandH.Iwaniec.PowermeanvaluesoftheRiemannzetafunction. Mathematika, 29(2):202–212, 1982
1982
-
[10]
Deshouillers and H
J.-M. Deshouillers and H. Iwaniec. Power mean-values for Dirichlet’s polynomials and the Riemann zeta-function. II. Acta Arith., 43(3):305–312, 1984
1984
-
[11]
Kloosterman sums and Fourier coefficients of cusp forms.Invent
Jean-Marc Deshouillers and Henryk Iwaniec. Kloosterman sums and Fourier coefficients of cusp forms.Invent. Math., 70(2):219–288, 1982
1982
-
[12]
One-level density estimates for DirichletL-functions with extended support.Algebra Number Theory, 17(4):805–830, 2023
Sary Drappeau, Kyle Pratt, and Maksym Radziwiłł. One-level density estimates for DirichletL-functions with extended support.Algebra Number Theory, 17(4):805–830, 2023
2023
-
[13]
Bilinear forms with Kloosterman fractions.Invent
William Duke, John Friedlander, and Henryk Iwaniec. Bilinear forms with Kloosterman fractions.Invent. Math., 128(1):23–43, 1997
1997
-
[14]
Algebraic trace functions over the primes.Duke Math
Étienne Fouvry, Emmanuel Kowalski, and Philippe Michel. Algebraic trace functions over the primes.Duke Math. J., 163(9):1683–1736, 2014
2014
-
[15]
Lectures on appliedℓ-adic cohomology
Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, and Will Sawin. Lectures on appliedℓ-adic cohomology. In Analytic methods in arithmetic geometry, volume 740 ofContemp. Math., pages 113–195. Amer. Math. Soc., [Providence], RI, [2019]©2019
2019
-
[16]
Springer- Verlag, New York, 1991
William Fulton and Joe Harris.Representation theory, volume 129 ofGraduate Texts in Mathematics. Springer- Verlag, New York, 1991. A first course, Readings in Mathematics
1991
-
[17]
On the greatest prime factor and uniform equidistribution of quadratic polynomials
Lasse Grimmelt and Jori Merikoski. On the greatest prime factor and uniform equidistribution of quadratic polynomials. Preprint, arXiv:2505.00493, 2025
2025 arXiv
-
[18]
New large value estimates for Dirichlet polynomials.Ann
Larry Guth and James Maynard. New large value estimates for Dirichlet polynomials.Ann. of Math., to appear. Preprint, arXiv:2405.20552, 2024
2024 arXiv
-
[19]
H. A. Helfgott. Growth and generation inSL2(Z/pZ). Ann. of Math. (2), 167(2):601–623, 2008
2008
-
[20]
Martin Isaacs.Character theory of finite groups
I. Martin Isaacs.Character theory of finite groups. AMS Chelsea Publishing, Providence, RI, 2006. Corrected reprint of the 1976 original [Academic Press, New York; MR0460423]
2006
-
[21]
American Mathematical Society, Providence, RI, 2021
Henryk Iwaniec and Emmanuel Kowalski.Analytic number theory, volume 53. American Mathematical Society, Providence, RI, 2021
2021
-
[22]
and Wu, Xiaosheng and Xi, Ping
Kerr, Bryce and Shparlinski, Igor E. and Wu, Xiaosheng and Xi, Ping. Bounds on bilinear forms with Klooster- man sums.J. Lond. Math. Soc. (2), 108(2):578–621, 2023
2023
-
[23]
Henry H. Kim. Functoriality for the exterior square ofGL4 and the symmetric fourth ofGL2. J. Amer. Math. Soc., 16(1):139–183, 2003. With Appendix 1 by Dinakar Ramakrishnan and Appendix 2 by Kim and Peter Sarnak
2003
-
[24]
Bilinear forms with Kloosterman sums and applications
Emmanuel Kowalski, Philippe Michel, and Will Sawin. Bilinear forms with Kloosterman sums and applications. Ann. of Math. (2), 186(2):413–500, 2017
2017
-
[25]
Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums.Ann
Emmanuel Kowalski, Philippe Michel, and Will Sawin. Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums.Ann. Sc. Norm. Super. Pisa Cl. Sci. (5), 21:1453–1530, 2020
2020
-
[26]
Philip C. Kutzko. The characters of the binary modular congruence group.Bull. Amer. Math. Soc., 79:702–704, 1973
1973
-
[27]
Kuznetsov
Nikolai V. Kuznetsov. The Petersson conjecture for cusp forms of weight zero and the Linnik conjecture. Sums of Kloosterman sums.Mat. Sb. (N.S.), 111(153)(3):334–383, 479, 1980
1980
-
[28]
Primes in Arithmetic Progressions to Large Moduli I: Fixed Residue Classes.Mem
James Maynard. Primes in Arithmetic Progressions to Large Moduli I: Fixed Residue Classes.Mem. Amer. Math. Soc., 306(1542), 2025. NON-ABELIAN AMPLIFICATION AND BILINEAR FORMS WITH KLOOSTERMAN SUMS 49
2025
-
[30]
Moshchevitin and Ilya D
Nikolay G. Moshchevitin and Ilya D. Shkredov. On a modular form of Zaremba’s conjecture.Pacific J. Math., 309(1):195–211, 2020
2020
-
[31]
Die irreduziblen Darstellungen der Gruppen SL2(Zp), insbesondere SL2(Zp)
Alexandre Nobs and Jürgen Wolfart. Die irreduziblen Darstellungen der Gruppen SL2(Zp), insbesondere SL2(Zp). II.Comment. Math. Helv., 51(4):491–526, 1976
1976
-
[32]
Large sieve inequalities for exceptional Maass forms and the greatest prime factor ofn2 + 1
Alexandru Pascadi. Large sieve inequalities for exceptional Maass forms and the greatest prime factor ofn2 + 1. Forum Math. Pi, to appear. Preprint, arXiv:2404.04239, 2025
2025
-
[33]
On the exponents of distribution of primes and smooth numbers.Preprint, arXiv:2505.00653, 2025
Alexandru Pascadi. On the exponents of distribution of primes and smooth numbers.Preprint, arXiv:2505.00653, 2025
2025 arXiv
-
[34]
On the estimation of Fourier coefficients of modular forms
Atle Selberg. On the estimation of Fourier coefficients of modular forms. InProc. Sympos. Pure Math., Vol. VIII, pages 1–15. Amer. Math. Soc., Providence, RI, 1965
1965
-
[35]
Linear representations of finite groups, volume Vol
Jean-Pierre Serre. Linear representations of finite groups, volume Vol. 42 ofGraduate Texts in Mathematics. Springer-Verlag, New York-Heidelberg, french edition, 1977
1977
-
[36]
Joseph A. Shalika. Representation of the two by two unimodular group over local fields. InContributions to automorphic forms, geometry, and number theory, pages 1–38. Johns Hopkins Univ. Press, Baltimore, MD, 2004
2004
-
[37]
I. D. Shkredov. On asymptotic formulae in some sum-product questions.Trans. Moscow Math. Soc., 79:231–281, 2018
2018
-
[38]
I. D. Shkredov. Modular hyperbolas and bilinear forms of Kloosterman sums.J. Number Theory, 220:182–211, 2021
2021
-
[39]
Shparlinski
Igor E. Shparlinski. On sums of Kloosterman and Gauss sums.Trans. Amer. Math. Soc., 371(12):8679–8697, 2019
2019
-
[40]
Shparlinski and Tianping Zhang
Igor E. Shparlinski and Tianping Zhang. Cancellations amongst Kloosterman sums.Acta Arith., 176(3):201–210, 2016
2016
-
[41]
Irreducible representations of the binary modular congruence groupsmod pλ
Shunichi Tanaka. Irreducible representations of the binary modular congruence groupsmod pλ. J. Math. Kyoto Univ., 7:123–132, 1967
1967
-
[42]
Cambridge University Press, Cambridge, 1999
Audrey Terras.Fourier analysis on finite groups and applications, volume 43 ofLondon Mathematical Society Student Texts. Cambridge University Press, Cambridge, 1999
1999
-
[43]
The shifted convolution of generalized divisor functions
Berke Topacogullari. The shifted convolution of generalized divisor functions. Int. Math. Res. Not. IMRN, (24):7681–7724, 2018
2018
-
[44]
Arithmetic exponent pairs for algebraic trace functions and applications.Algebra Number Theory, 15(9):2123–2172, 2021
Jie Wu and Ping Xi. Arithmetic exponent pairs for algebraic trace functions and applications.Algebra Number Theory, 15(9):2123–2172, 2021. With an appendix by Will Sawin
2021
-
[45]
The fourth moment of DirichletL-functions at the central value.Math
Xiaosheng Wu. The fourth moment of DirichletL-functions at the central value.Math. Ann., 387(3-4):1199–1248, 2023
2023
-
[46]
Ternary divisor functions in arithmetic progressions to smooth moduli.Mathematika, 64(3):701–729, 2018
Ping Xi. Ternary divisor functions in arithmetic progressions to smooth moduli.Mathematika, 64(3):701–729, 2018
2018
-
[47]
Matthew P. Young. The fourth moment of DirichletL-functions. Ann. of Math. (2), 173(1):1–50, 2011. Mathematisches Institut, Endenicher Allee 60, 53115 Bonn, Germany Email address: alexpascadi@gmail.com
2011
Reviewed August 3, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.