Bourgain and Chang (2010) proved that if is a nontrivial multiplicative character modulo a large prime and are linearly independent linear forms over , then the multilinear sum over a cube of side admits a power saving 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 satisfying only the volumetric condition , under which individual sides may be far shorter than ; their methods, they noted, settle only small . 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 , and Gabdullin and Chattopadhyay for the related Davenport–Lewis problem over — 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 and a nontrivial multiplicative (Dirichlet) character modulo , extended to all of by the convention . For an interval of consecutive integers one wants upper bounds for that beat the trivial bound . Burgess's classical inequality (1962) gives a power saving: for every there is such that the sum is as soon as , uniformly in and . The exponent (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 by a product of linear forms. Let be linear forms in the variables over forming a nondegenerate system — that is, the coefficient matrix is invertible over — and consider
where the integer vector ranges over a cube of side and the arguments are reduced modulo . For the argument of is a binary quadratic form: Burgess (1968) obtained a nontrivial bound for and stated without proof an extension to products of linearly independent linear forms at the weaker threshold . Chang (2009) reached the Burgess threshold for , in both the irreducible and reducible cases. Bourgain and Chang (2010) settled the general case for cubes: if then with , uniformly in the system of forms, the character, and the cube's location; for this recovers Burgess's theorem.
The proof of Bourgain–Chang follows the Burgess amplification scheme — shifting and averaging over the shift — which reduces the estimate to a bound on a multiplicative energy: the number of quadruples in suitable cubes with for all . (In general, the multiplicative energy of a set is the number of solutions of with .) 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 and a symmetric convex body, the product of the successive minima (the smallest scale factors at which the body contains 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 where is a nontrivial multiplicative character of the extension field (not of ) and is a box in the coordinates of a basis of over ; when factors through the field norm (the map sending an element to the product of its conjugates) this becomes a mod- character evaluated at a norm form, a homogeneous polynomial that is irreducible over but splits into conjugate linear forms over . Davenport and Lewis (1963) obtained per-side thresholds , improved by Chang (2008), who reached the volumetric condition for arbitrary bases, and by Konyagin (2010), who attained the Burgess threshold in each coordinate. Second, for mod- characters at general homogeneous forms, Pierce and Xu (2020) obtained bounds for generic forms, nontrivial only when each side exceeds , and Chu (2025) — the strongest published result for the present problem's class of sums — treats forms of degree in variables that split into linearly independent linear factors over the algebraic closure (a class containing both the split forms of Bourgain–Chang and the norm forms), achieving a power saving whenever every side length satisfies .
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 where and (it is easily seen that it suffices to consider the case ). The methods described above permit to prove such statement for small values of , but the general case remains to be settled.' The problem is to settle that general case.
Precisely: fix an integer and . Do there exist and such that the following holds for every prime ? For every nontrivial multiplicative character mod , every system of linear forms in whose coefficient matrix is invertible over , and every axis-parallel box with integers satisfying the volume condition
the sum
(with arguments reduced mod and ) satisfies
with the estimate uniform in , in the system of forms, and in the location of the box. For this is exactly the classical Burgess bound; the open content is with arbitrary, not necessarily comparable, side lengths, so that individual sides may be far shorter than as long as the volume condition holds. As noted in the source remark, it suffices to treat the case for all . Thus the estimate holds for all and all , unless for some and there exist, for arbitrarily large , characters, form systems, and boxes with volume above for which no power saving over holds.
References
- 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
- 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
- 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
- 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
- Mei-Chu Chang, Burgess inequality in , 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
- 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
- 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
- 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
- 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
- Rena Chu, Short character sums of inhomogeneous polynomials, arXiv:2609.04092 (2026), https://arxiv.org/abs/2609.04092
- Mikhail Gabdullin, Estimates for character sums in finite fields of order and , Proc. Steklov Inst. Math. 303 (2018), no. 1, 36–49. DOI: 10.1134/S0081543818080059, arXiv:1806.04783, https://arxiv.org/abs/1806.04783
- Aishik Chattopadhyay, Burgess-type volume centric bounds for character sums over , arXiv:2602.22167 (2026, current version v5), https://arxiv.org/abs/2602.22167
- É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