Bourgain and Chang (2010) proved that if χ\chi is a nontrivial multiplicative character modulo a large prime pp and L1,…,LnL_1,\dots,L_n are linearly independent linear forms over Fp\mathbb{F}_p, then the multilinear sum ∑xχ(∏j=1nLj(x))\sum_{\mathbf{x}}\chi(\prod_{j=1}^n L_j(\mathbf{x})) over a cube of side H>p1/4+εH>p^{1/4+\varepsilon} admits a power saving p−δp^{-\delta} over the trivial bound, uniformly in the forms and the character. In a closing remark they asked for the box analogue: the same power saving over an arbitrary axis-parallel box of side lengths H1,…,HnH_1,\dots,H_n satisfying only the volumetric condition ∏iHi>pn/4+ε\prod_i H_i>p^{n/4+\varepsilon}, under which individual sides may be far shorter than p1/4p^{1/4}; their methods, they noted, settle only small nn. Later work has advanced the surrounding theory — Pierce–Xu for generic forms at weaker per-side thresholds, Chu (2025) for forms splitting over the algebraic closure with every side at least p1/4+κp^{1/4+\kappa}, and Gabdullin and Chattopadhyay for the related Davenport–Lewis problem over Fpn\mathbb{F}_{p^n} — but the known bounds for polynomial-argument character sums that reach below the Burgess threshold on individual sides require the number of variables to be large relative to the degree, so the multilinear box problem is untouched. The problem asks for a proof, or a disproof, of the volumetric box estimate for the multilinear character sum in arbitrary dimension.

Background

The study of short character sums is a central topic in analytic number theory. Fix a prime pp and a nontrivial multiplicative (Dirichlet) character χ\chi modulo pp, extended to all of Fp\mathbb{F}_p by the convention χ(0)=0\chi(0)=0. For an interval of HH consecutive integers one wants upper bounds for ∣∑x=N+1N+Hχ(x)∣|\sum_{x=N+1}^{N+H}\chi(x)| that beat the trivial bound HH. Burgess's classical inequality (1962) gives a power saving: for every ε>0\varepsilon>0 there is δ>0\delta>0 such that the sum is ≪p−δH\ll p^{-\delta}H as soon as H>p1/4+εH>p^{1/4+\varepsilon}, uniformly in NN and χ\chi. The exponent 1/41/4 (the Burgess threshold) is the natural barrier of the method and has essentially not been improved in over sixty years.

A multivariate generalization replaces the linear argument of χ\chi by a product of linear forms. Let L1,…,LnL_1,\dots,L_n be linear forms in the variables x1,…,xnx_1,\dots,x_n over Fp\mathbb{F}_p forming a nondegenerate system — that is, the n×nn\times n coefficient matrix is invertible over Fp\mathbb{F}_p — and consider

S=∑x ∈ ∏i=1n[ai, ai+H]χ(∏j=1nLj(x)),S = \sum_{\mathbf{x}\,\in\,\prod_{i=1}^n [a_i,\,a_i+H]} \chi\Big(\prod_{j=1}^{n} L_j(\mathbf{x})\Big),

where the integer vector x\mathbf{x} ranges over a cube of side HH and the arguments are reduced modulo pp. For n=2n=2 the argument of χ\chi is a binary quadratic form: Burgess (1968) obtained a nontrivial bound for H>p1/3+εH>p^{1/3+\varepsilon} and stated without proof an extension to products of nn linearly independent linear forms at the weaker threshold H>p1/2−1/(2(n+1))+εH>p^{1/2-1/(2(n+1))+\varepsilon}. Chang (2009) reached the Burgess threshold p1/4+εp^{1/4+\varepsilon} for n=2n=2, in both the irreducible and reducible cases. Bourgain and Chang (2010) settled the general case for cubes: if H>p1/4+εH>p^{1/4+\varepsilon} then ∣S∣<p−δHn|S|<p^{-\delta}H^n with δ=δn(ε)>0\delta=\delta_n(\varepsilon)>0, uniformly in the system of forms, the character, and the cube's location; for n=1n=1 this recovers Burgess's theorem.

The proof of Bourgain–Chang follows the Burgess amplification scheme — shifting x↦x+ty\mathbf{x}\mapsto\mathbf{x}+t\mathbf{y} and averaging over the shift — which reduces the estimate to a bound on a multiplicative energy: the number of quadruples (x,y,x′,y′)(\mathbf{x},\mathbf{y},\mathbf{x}',\mathbf{y}') in suitable cubes with Ljx⋅Ljy≡Ljx′⋅Ljy′(modp)L_j\mathbf{x}\cdot L_j\mathbf{y}\equiv L_j\mathbf{x}'\cdot L_j\mathbf{y}' \pmod p for all jj. (In general, the multiplicative energy of a set AA is the number of solutions of ab=a′b′ab=a'b' with a,a′,b,b′∈Aa,a',b,b'\in A.) Their new ingredient is an estimate for this energy via the geometry of numbers: the solution sets are points of a lattice, controlled by Minkowski's second theorem — the fact that for a lattice Λ⊂Rd\Lambda\subset\mathbb{R}^d and a symmetric convex body, the product of the successive minima λ1≤⋯≤λd\lambda_1\le\dots\le\lambda_d (the smallest scale factors at which the body contains 1,2,…1,2,\dots linearly independent lattice vectors) is comparable to the lattice covolume (the volume of the lattice's fundamental domain) — together with lattice duality, the passage from a lattice to its dual lattice of vectors having integral inner product with every lattice vector. The argument exploits the symmetry of the cube at several scales.

Two neighboring problem families set the context. First, the Davenport–Lewis problem: bound ∑x∈Bχ(∑ixiωi)\sum_{\mathbf{x}\in B}\chi(\sum_i x_i\omega_i) where χ\chi is a nontrivial multiplicative character of the extension field Fpn\mathbb{F}_{p^n} (not of Fp\mathbb{F}_p) and BB is a box in the coordinates of a basis {ω1,…,ωn}\{\omega_1,\dots,\omega_n\} of Fpn\mathbb{F}_{p^n} over Fp\mathbb{F}_p; when χ\chi factors through the field norm (the map N:Fpn→FpN:\mathbb{F}_{p^n}\to\mathbb{F}_p sending an element to the product of its conjugates) this becomes a mod-pp character evaluated at a norm form, a homogeneous polynomial that is irreducible over Fp\mathbb{F}_p but splits into conjugate linear forms over Fpn\mathbb{F}_{p^n}. Davenport and Lewis (1963) obtained per-side thresholds p1/2−1/(2(n+1))+εp^{1/2-1/(2(n+1))+\varepsilon}, improved by Chang (2008), who reached the volumetric condition ∏iHi>p(2/5+ε)n\prod_i H_i>p^{(2/5+\varepsilon)n} for arbitrary bases, and by Konyagin (2010), who attained the Burgess threshold p1/4+εp^{1/4+\varepsilon} in each coordinate. Second, for mod-pp characters at general homogeneous forms, Pierce and Xu (2020) obtained bounds for generic forms, nontrivial only when each side exceeds p1/2−1/(2(n+1))+κp^{1/2-1/(2(n+1))+\kappa}, and Chu (2025) — the strongest published result for the present problem's class of sums — treats forms of degree nn in nn variables that split into linearly independent linear factors over the algebraic closure F‾p\overline{\mathbb{F}}_p (a class containing both the split forms of Bourgain–Chang and the norm forms), achieving a power saving whenever every side length satisfies Hi≥p1/4+κH_i\ge p^{1/4+\kappa}.

All of these results control each side of the summation box individually. Bourgain and Chang's final remark asks precisely for the volumetric version in the split (multilinear) setting, and it is this box analogue that remains unsettled.

Problem Statement

Bourgain and Chang (2010) proved their multilinear Burgess bound for cubes and wrote in their final remark: 'One expects the analogue of the theorem to remain valid when summing over arbitrary boxes BH1,…,Hn={ai≤xi≤ai+Hi (1≤i≤n)}B_{H_1,\dots,H_n}=\{a_i\le x_i\le a_i+H_i\ (1\le i\le n)\} where 0<Hi<p0<H_i<p and ∏i=1nHi>pn/4+ε\prod_{i=1}^n H_i>p^{n/4+\varepsilon} (it is easily seen that it suffices to consider the case Hi≤pH_i\le\sqrt p). The methods described above permit to prove such statement for small values of nn, but the general case remains to be settled.' The problem is to settle that general case.

Precisely: fix an integer n≥2n\ge2 and ε>0\varepsilon>0. Do there exist δ=δ(n,ε)>0\delta=\delta(n,\varepsilon)>0 and p0=p0(n,ε)p_0=p_0(n,\varepsilon) such that the following holds for every prime p>p0p>p_0? For every nontrivial multiplicative character χ\chi mod pp, every system L1,…,LnL_1,\dots,L_n of linear forms in x1,…,xnx_1,\dots,x_n whose coefficient matrix is invertible over Fp\mathbb{F}_p, and every axis-parallel box B=∏i=1n[ai, ai+Hi]B=\prod_{i=1}^n [a_i,\,a_i+H_i] with integers 0<Hi<p0<H_i<p satisfying the volume condition

∏i=1nHi>p n/4+ε,\prod_{i=1}^{n} H_i > p^{\,n/4+\varepsilon},

the sum

S=∑x∈Bχ(∏j=1nLj(x))S = \sum_{\mathbf{x}\in B}\chi\Big(\prod_{j=1}^n L_j(\mathbf{x})\Big)

(with arguments reduced mod pp and χ(0)=0\chi(0)=0) satisfies

∣S∣≤p−δ∏i=1nHi,|S| \le p^{-\delta}\prod_{i=1}^n H_i,

with the estimate uniform in χ\chi, in the system of forms, and in the location of the box. For n=1n=1 this is exactly the classical Burgess bound; the open content is n≥2n\ge2 with arbitrary, not necessarily comparable, side lengths, so that individual sides may be far shorter than p1/4p^{1/4} as long as the volume condition holds. As noted in the source remark, it suffices to treat the case Hi≤pH_i\le\sqrt p for all ii. Thus the estimate holds for all n≥2n\ge2 and all ε>0\varepsilon>0, unless for some n≥2n\ge2 and ε>0\varepsilon>0 there exist, for arbitrarily large pp, characters, form systems, and boxes with volume above pn/4+εp^{n/4+\varepsilon} for which no power saving over ∏iHi\prod_i H_i holds.

References

  1. Jean Bourgain and Mei-Chu Chang, On a multilinear character sum of Burgess, C. R. Math. Acad. Sci. Paris 348 (2010), no. 3–4, 115–120. DOI: 10.1016/j.crma.2009.12.013, https://doi.org/10.1016/j.crma.2009.12.013
  2. D. A. Burgess, On character sums and primitive roots, Proc. London Math. Soc. (3) 12 (1962), 179–192. DOI: 10.1112/plms/s3-12.1.179, https://doi.org/10.1112/plms/s3-12.1.179
  3. D. A. Burgess, A note on character sums of binary quadratic forms, J. London Math. Soc. 43 (1968), 271–274. DOI: 10.1112/jlms/s1-43.1.271, https://doi.org/10.1112/jlms/s1-43.1.271
  4. Mei-Chu Chang, On a question of Davenport and Lewis and new character sum bounds in finite fields, Duke Math. J. 145 (2008), no. 3, 409–442. DOI: 10.1215/00127094-2008-056, https://doi.org/10.1215/00127094-2008-056
  5. Mei-Chu Chang, Burgess inequality in Fp2\mathbb{F}_{p^2}, Geom. Funct. Anal. 19 (2009), no. 4, 1001–1016. DOI: 10.1007/s00039-009-0031-5, https://doi.org/10.1007/s00039-009-0031-5
  6. H. Davenport and D. J. Lewis, Character sums and primitive roots in finite fields, Rend. Circ. Mat. Palermo (2) 12 (1963), 129–136. DOI: 10.1007/BF02843959, https://doi.org/10.1007/BF02843959
  7. S. V. Konyagin, Estimates of character sums in finite fields, Math. Notes 88 (2010), no. 3–4, 503–515 (English translation; Russian original: Mat. Zametki 88 (2010), no. 4). DOI: 10.1134/S0001434610090221, https://doi.org/10.1134/S0001434610090221
  8. Lillian B. Pierce and Junyan Xu, Burgess bounds for short character sums evaluated at forms, Algebra & Number Theory 14 (2020), no. 7, 1911–1951. DOI: 10.2140/ant.2020.14.1911, https://doi.org/10.2140/ant.2020.14.1911
  9. Rena Chu, Estimates for short character sums evaluated at homogeneous polynomials, J. Lond. Math. Soc. (2) 112 (2025), no. 5, Paper No. e70351. DOI: 10.1112/jlms.70351, arXiv:2501.12325, https://arxiv.org/abs/2501.12325
  10. Rena Chu, Short character sums of inhomogeneous polynomials, arXiv:2609.04092 (2026), https://arxiv.org/abs/2609.04092
  11. Mikhail Gabdullin, Estimates for character sums in finite fields of order p2p^2 and p3p^3, Proc. Steklov Inst. Math. 303 (2018), no. 1, 36–49. DOI: 10.1134/S0081543818080059, arXiv:1806.04783, https://arxiv.org/abs/1806.04783
  12. Aishik Chattopadhyay, Burgess-type volume centric bounds for character sums over Fpn\mathbb{F}_{p^n}, arXiv:2602.22167 (2026, current version v5), https://arxiv.org/abs/2602.22167
  13. Étienne Fouvry, Igor E. Shparlinski, and Ping Xi, Estimates for trilinear and quadrilinear character sums, Rev. Mat. Iberoamericana 41 (2025), no. 5, 1925–1956. DOI: 10.4171/rmi/1530, arXiv:2404.09295, https://doi.org/10.4171/rmi/1530