pith. sign in

arxiv: 2602.22167 · v4 · submitted 2026-02-25 · 🧮 math.NT

Burgess-Type Bounds for Character Sums over mathbb{F}_(p^n)

Aishik Chattopadhyay This is my paper

Pith reviewed 2026-05-15 19:11 UTC · model grok-4.3

classification 🧮 math.NT
keywords character sumsfinite fieldsBurgess boundsmultiplicative charactersgeometry of numbersexponential sumsfinite field extensions
0
0 comments X

The pith

Character sums over boxes in F_{p^n} show nontrivial cancellation above volumetric threshold p^{n(1/4 + ε)}

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that multiplicative character sums over a box B inside the finite field F_{p^n} exhibit nontrivial cancellation once the box contains at least p to the power n times (1/4 plus a small positive epsilon) elements. This holds under a condition that depends only on the total number of points in the box and requires no minimum length for any of its sides. Earlier results needed separate lower bounds on the lengths of the projections onto each coordinate axis, which restricted the shapes of boxes that could be handled. The new argument removes those restrictions and extends the conclusion from dimensions two and three to every dimension n. A reader cares because the bounds now apply to a larger family of sets that arise when estimating exponential sums in number theory.

Core claim

We establish Burgess-type bounds for short multiplicative character sums over finite fields F_{p^n} under a purely volumetric condition. We show that for a box B subset F_{p^n}, nontrivial cancellation occurs whenever |B| >= p^{n(1/4+ε)}, without imposing lower bounds on the individual side lengths. This removes the coordinate-wise restrictions present in earlier results and extends work of Gabdullin for n=2,3 to arbitrary dimension. The proof combines methods from the geometry of numbers with multiplicative energy estimates and bounds for character sums due to Katz.

What carries the argument

Geometry-of-numbers argument that converts a volumetric lower bound on the box into control over additive energies, used together with multiplicative energy estimates and Katz bounds on character sums.

If this is right

  • Nontrivial cancellation holds for boxes of sufficient volume in every dimension n.
  • The result applies without any lower bounds on the individual side lengths of the box.
  • Coordinate-wise restrictions from earlier work are removed, allowing more general boxes.
  • The extension covers arbitrary n by building on the low-dimensional cases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The volumetric condition may enable better estimates for unbalanced or irregular boxes that arise in applications.
  • The geometry-of-numbers step could be tested or adapted for related exponential sums over finite fields.
  • Computational checks for small p and moderate n would directly probe whether the volume threshold is sharp.

Load-bearing premise

The box B admits a geometry-of-numbers argument that converts the volumetric lower bound into control over additive energies without requiring separate lower bounds on each coordinate projection.

What would settle it

A concrete box B in F_{p^n} whose volume is only slightly larger than p^{n/4} yet whose associated character sum fails to exhibit the predicted level of cancellation.

read the original abstract

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever $|B| \ge p^{n(1/4+\varepsilon)}$, without imposing lower bounds on the individual side lengths. This removes the coordinate-wise restrictions present in earlier results and extends work of Gabdullin for $n=2,3$ to arbitrary dimension. The proof combines methods from the geometry of numbers with multiplicative energy estimates and bounds for character sums due to Katz.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript establishes Burgess-type bounds for short multiplicative character sums over finite fields F_{p^n}. For a box B subset F_{p^n} satisfying the volumetric condition |B| >= p^{n(1/4 + epsilon)}, nontrivial cancellation is obtained without imposing lower bounds on the individual side lengths. The proof combines geometry of numbers to control additive energies, multiplicative energy estimates, and Katz bounds on character sums, extending Gabdullin's results for n=2,3 to arbitrary n.

Significance. If correct, the result would be a meaningful advance by removing coordinate-wise restrictions present in prior work, enabling more uniform applications of short character sum bounds in higher-dimensional finite fields. The integration of geometric methods with energy estimates appears technically sound in outline and could influence related problems in analytic number theory over F_q.

major comments (1)
  1. [§3 (geometry of numbers argument)] The geometry-of-numbers step (converting the sole volumetric hypothesis |B| ≳ p^{n(1/4+ε)} into an additive-energy bound) requires explicit verification for highly anisotropic boxes. In the identification F_{p^n} ≅ F_p^n, when one coordinate projection is ≳ p^{n/4+ε} and the others have length 1, Minkowski's theorem on successive minima may yield only a weaker energy estimate than needed to beat the trivial bound after feeding into the multiplicative-energy and Katz steps.
minor comments (2)
  1. [Introduction] Clarify the precise definition of a 'box' B in the vector-space model and state whether the implied constants in the final bound depend on n or epsilon.
  2. [§1] Add a short remark comparing the new volumetric threshold to the coordinate-wise thresholds in Gabdullin's n=2,3 cases.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. We address the single major comment below and will revise the manuscript to incorporate an explicit verification as suggested.

read point-by-point responses

  1. Referee: [§3 (geometry of numbers argument)] The geometry-of-numbers step (converting the sole volumetric hypothesis |B| ≳ p^{n(1/4+ε)} into an additive-energy bound) requires explicit verification for highly anisotropic boxes. In the identification F_{p^n} ≅ F_p^n, when one coordinate projection is ≳ p^{n/4+ε} and the others have length 1, Minkowski's theorem on successive minima may yield only a weaker energy estimate than needed to beat the trivial bound after feeding into the multiplicative-energy and Katz steps.

    Authors: We appreciate the referee's observation on this point. The geometry-of-numbers argument in §3 is formulated in terms of the successive minima of the convex body associated to the box in the standard basis of F_p^n, and the volumetric lower bound on |B| directly controls the product of the minima via Minkowski's theorem. This control is independent of the anisotropy of the box and suffices to produce an additive-energy upper bound that, when combined with the multiplicative-energy estimates and Katz's character-sum bounds, yields a nontrivial saving over the trivial estimate. To make the argument fully transparent, however, we will add an explicit verification for the highly anisotropic case (one coordinate of length ≳ p^{n/4+ε} and the remaining coordinates of length 1) in the revised manuscript. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on external Katz bounds and standard geometry-of-numbers tools

full rationale

The paper establishes Burgess-type bounds for character sums over F_{p^n} by converting a purely volumetric lower bound |B| ≳ p^{n(1/4+ε)} into additive-energy control via geometry of numbers, then feeding the result into multiplicative-energy estimates and Katz character-sum bounds. No load-bearing step reduces by construction to a fitted parameter, self-definition, or self-citation chain; the cited Katz bounds are independent external results, and the geometry-of-numbers argument invokes standard Minkowski theorems without importing uniqueness statements or ansatzes from the authors' prior work. The extension of Gabdullin's n=2,3 cases therefore rests on external tools rather than circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on standard facts about finite fields, multiplicative characters, and the geometry of numbers, plus the external Katz bounds; no new free parameters or invented entities are introduced in the abstract.

axioms (2)
  • standard math Standard properties of finite fields F_{p^n} and nontrivial multiplicative characters
    Invoked as background throughout the argument.
  • domain assumption Katz bounds for character sums
    Used as a black-box input to the energy estimates.

pith-pipeline@v0.9.0 · 5394 in / 1290 out tokens · 27464 ms · 2026-05-15T19:11:46.576505+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Banaszczyk,Inequalities for convex bodies and polar reciprocal lattices inRn, Discrete Comput

    W. Banaszczyk,Inequalities for convex bodies and polar reciprocal lattices inRn, Discrete Comput. Geom. 13 (2), 217-231 (1995)

    work page 1995

  2. [2]

    Betke, M

    U. Betke, M. Henk, J. M. Wills,Successive-minima-types inequalities, Discrete Comput. Geom., 9:2 (1993), 165-175

    work page 1993

  3. [3]

    D. A. Burgess,On character sums and primitive roots, Proc. London Math. Soc. (3) 12 (1962), 179-192

    work page 1962

  4. [4]

    D. A. Burgess,Character sums and primitive roots in finite fields, Proc. London Math. Soc. (3) 37 (1967), 11-35

    work page 1967

  5. [5]

    M. C. Chang,On a question of Davenport and Lewis and new character sum bounds in finite fields, Duke Math. J. 145:3 (2008), 409-422

    work page 2008

  6. [6]

    Chang,Burgess inequality inF p2, Geom

    M.-C. Chang,Burgess inequality inF p2, Geom. Funct. Anal. 19 (2009), 1001–1016

    work page 2009

  7. [7]

    Chattopadhyay,A Short Character Sum inFp3, https://doi.org/10.48550/arXiv.2505.19654

    A. Chattopadhyay,A Short Character Sum inFp3, https://doi.org/10.48550/arXiv.2505.19654

    work page doi:10.48550/arxiv.2505.19654

  8. [8]

    Davenport, D

    H. Davenport, D. Lewis,Character sums and primitive roots in finite fields, Rend. Circ. Matem. Palermo-Serie II-Tomo XII-Anno (1963)

    work page 1963

  9. [9]

    Friedlander, H

    J. Friedlander, H. Iwaniec,Estimates of character sums, Proc. Amer. Math. Soc. 119:2 (1993), 265-372. 18 AISHIK CHATTOPADHYAY

    work page 1993

  10. [10]

    Gabdullin,Estimates for character sums in finite fields of orderp2 andp 3, Proc

    M. Gabdullin,Estimates for character sums in finite fields of orderp2 andp 3, Proc. Steklov Inst. Math., vol. 303 (2018), 36-49

    work page 2018

  11. [11]

    A. A. Karatsuba,Estimates of character sums, Math. USSR Izv. 4 (1970), no. 1, 19–29

    work page 1970

  12. [12]

    Katz,An estimate of character sums, Journal of the American Mathematical Society Vol

    N. Katz,An estimate of character sums, Journal of the American Mathematical Society Vol. 2, No 2 1989, 197-200

    work page 1989

  13. [13]

    S. V. Konyagin,Estimates for character sums in finite fields (Russian), Mat. Zametki 88 (2010), no. 4, 529-542; translation in Math. Notes 88 (2010), no. 3-4, 503-515

    work page 2010

  14. [14]

    SchmidtEquations over Finite Fields: An Elementary Approach, Lecture Notes in Mathematics

    W.M. SchmidtEquations over Finite Fields: An Elementary Approach, Lecture Notes in Mathematics. 536. Berlin-Heidelberg-New York: Springer-Verlag. ix, 267 p. (1976)

    work page 1976

  15. [15]

    T. Tao, V. Vu,Additive Combinatorics, Cambridge University Press, 2006. Aishik Chattopadhyay, Ramakrishna Mission Vivekananda Educational and Research Institute, Department of Mathematics, G. T. Road, PO Belur Math, Howrah, West Bengal 711202, India Email address:aishik.ch@gmail.com

    work page 2006