Mixed Character Sum Bounds

• Mixed Character Sum Bounds are rigorous estimates for sums that combine multiplicative and additive characters over finite fields, crucial for revealing nontrivial cancellation.
• Techniques such as subspace dissection, high-moment Hölder’s inequalities, and combinatorial geometry push beyond classical square-root barriers and Burgess limits.
• These bounds have significant applications in analytic number theory, additive combinatorics, and arithmetic geometry, impacting subconvexity, pseudorandomness, and cryptographic analyses.

Mixed Character Sum Bounds are estimates for sums involving both multiplicative and additive characters over finite fields or residue rings, often evaluated at polynomial or rational arguments, and frequently with additional algebraic or combinatorial restrictions. This topic explores nontrivial cancellation in such sums, aiming to optimize upper bounds—typically below the square-root or Burgess barrier—by leveraging algebraic structure, combinatorial geometry, analytic techniques, and recent mean-value theorems. Applications span analytic number theory, additive combinatorics, and arithmetic geometry, impacting areas such as subconvexity, pseudorandomness, and exponential sum phenomena.

1. Foundational Definitions and Classical Bounds

Let $\mathbb{F}_q$ be a finite field of characteristic $p$, $r \geq 1$, and $\mathbb{F}_{q^r}$ its degree-$r$ extension. For a basis $\{v_1,\dots,v_r\}$, a restricted-coordinate subset $S_r(A)$ is defined as

$$S_r(A) = \left\{ x = a_1v_1 + \cdots + a_rv_r\,:\;a_i \in A \right\},$$

with $A\subseteq\mathbb{F}_q$, $\#S_r(A) = (\#A)^r$. Mixed character sums are formed as

$$S_r(A;\chi,\psi;f_1,f_2) = \sum_{x\in S_r(A)} \chi(f_1(x))\, \psi(f_2(x)),$$

where $\chi$ is a multiplicative character (extended by $\chi(0)=0$), $\psi$ an additive character, and $f_1$, $f_2$ rational functions.

Classically, the trivial upper bound is $|S_r(A;\cdots)| \leq (\#A)^r$, and Burgess-type results for incomplete sums (with additive phase) yield nontrivial savings only for sums of length $>q^{1/4}$ in one variable.

2. Breakthroughs in Mixed Character Sum Bounds

Iyer–Shparlinski (Restricted Coordinates and Cantor-like Sets)

For $p = \log \#A / \log q$ and integer $s \geq 1$, Iyer–Shparlinski (Iyer et al., 2023) established

$$S_r(A;\chi,\psi;f_1,f_2) \ll (\#A)^r\, q^{-r K_s(p)}$$

where

$K_s(p) = \frac{sp(2p-1)+(p-1)}{4s(sp+1)},$

assuming nonprincipal $\chi$ and $f_1$ in $Q_{d_1,n}$, or nonprincipal $\psi$ and $f_2$ in $R_{d_2}$ (with rational function classes as above). Whenever $K_s(p)>0$ ($p > 1/2$, large enough $s$), this provides an exponential saving over the trivial bound.

Special cases include Cantor-like sets in $\mathbb{F}_{3^r}$ where $A=\{0,2\}$, yielding for $s=5$: $S_r(A;\chi,\psi;f_1,f_2) \ll 2^r 3^{-0.99128\,r}$ when $p\approx 0.6309$ (Iyer et al., 2023). The method relies on subspace dissection, high-moment Hölder’s inequality, exceptional-shift counting, and subspace Weil bounds.

Sparse Coordinate Sums

Merai–Shparlinski–Winterhof (Mérai et al., 2022) analyze sums over vectors of prescribed Hamming weight: $S_{s,r}(\chi,\psi;f_1,f_2) = \sum_{\nu\in\Grs} \chi(f_1(\nu))\,\psi(f_2(\nu)),$ with $\Grs = \{ \nu:\mathrm{wt}(\nu)=s \}$, showing

$$|S_{s,r}(\chi,\psi;f_1,f_2)| \ll_{d_1,d_2,q} (d_1+\max\{d_2,2\})\,2^{s+1}\binom{r}{s} q^{r/2}$$

for sufficiently non-degenerate $f_1, f_2$. For $q=2$, a combinatorial analysis yields bounds of the form

$$|S_{s,r}(\chi,\psi;f_1,f_2)| \leq 2^{\eta(\rho)r+o(r)}$$

with $\eta(\rho)<H(\rho)$ for $\rho\gtrsim 0.2145$, thus breaking the entropy barrier for very sparse sums.

3. Multilinear and High-Dimensional Character Sums

Fouvry–Shparlinski–Xi (Fouvry et al., 2024) and Shkredov–Shparlinski (Shkredov et al., 2016) address trilinear and quadrilinear forms: $$T(\alpha, \beta) = \sum_{k \le K} \sum_{m \le M} \sum_{n \le N} \alpha_m \beta_{k,n} \chi(a k + b m n)$$

$$Q(\alpha, \beta) = \sum_{k} \sum_\ell \sum_{m} \sum_n \alpha_{\ell,m} \beta_{k,n} \chi(a k\ell + b m n),$$

introducing bounds of the form

$$|T| \ll M^2 N K \Delta_2 p^{o(1)},\quad |Q| \ll L^2 K N p^{-\frac{2r}{2r-2}} \Delta_3 p^{o(1)}$$

with explicit nontriviality thresholds as low as $K, M, N \gg p^{1/8+\varepsilon}$, significantly beating the naive $p^{1/4}$ range and previous bilinear exponents. Key ingredients include repeated amplification/smoothing, application of high-moment Weil bounds, and precise incidence/energy lemmas.

4. Burgess Bounds for Mixed Sums in Multiple Variables

In higher dimensions, Pierce (Pierce, 2014), Kerr (Kerr, 2014), and Pierce–Xu (Pierce, 2020) utilize Vinogradov Mean Value Theorem (VMVT) and its multidimensional generalizations to achieve Burgess-type estimates

$$S_k(f;N,H) \ll \|H\|^{1-1/r} \|q\|^{(-r-M_{d,k}+1)/(4r(r-M_{d,k}))} q_{max}^{2rk/(4r(r-M_{d,k}))}$$

and, in the “minimal embedding” regime, stronger exponents for polynomials $f$ with “non-diagonal” monomial support. Nontrivial cancellation is achieved as soon as $H_i \gg q_i^{1/k+\epsilon}$, breaking the $1/4$ barrier for multi-variable sums.

Pierce–Xu (Pierce, 2020) further demonstrate that for $n$ variables,

$$|S| \ll H^{n - (n+1)/(2r)} q^{[n(\Theta-M)+1]/[4r(\Theta-M)] + \epsilon}$$

with thresholds $H \geq q^{1/2-1/(2(n+1)) + \kappa}$, leveraging the algebraic stratification results of Xu and the main VMVT for translation-dilation invariant systems.

5. Advanced Geometric and Combinatorial Approaches

Recent bounds exploit additive combinatorics, small-doubling phenomena, and geometric incidence results. Schoen–Shkredov (Schoen et al., 2020) show that if $A \subset \mathbb{F}_p$ and $|A+A| < K|A|$, then for a large set $B$,

$$|S(A,B;\chi)| = \left| \sum_{a\in A,\,b\in B}\chi(a+b) \right| < \exp\left(-c \left(\frac{\varepsilon_0^4 \log p}{\log^2K}\right)^{1/3}\right)|A||B|$$

yielding super-polynomial savings and applications to sum-product expansions (Balog-type theorems), surpassing both Burgess and classical Pólya–Vinogradov bounds.

6. Applications and Further Directions

Mixed character sum bounds underpin deep questions in analytic number theory, e.g., equidistribution, subconvexity for $L$-functions, randomness properties for cryptographic settings, and incidence geometry over finite fields. They resolve longstanding thresholds for incomplete sums, support combinatorial expansion hypotheses, and offer sharp tools for analyzing algebraic constructions such as Cantor sets, unions of intervals, and sparse coordinate sets in finite fields.

Open problems include optimally lowering multilinear exponent thresholds (e.g., pushing $1/8$ further down), understanding Paley graph phenomena in arbitrary sets, refining composite modulus analogues, and advancing geometric incidence bounds to improve combinatorial character sum estimates.

---

Table: Summary of Main Mixed Character-Sum Results

Paper/Authors	Main Bound Form	Nontriviality Thresholds
Iyer–Shparlinski (Iyer et al., 2023)	$(\#A)^r\,q^{-rK_s(p)}$	$p > 1/2$, $s$ large; Cantor sets ($p \approx 0.63$)
Fouvry–Shparlinski–Xi (Fouvry et al., 2024)	$M^2 N K \Delta_2 p^{o(1)}$	$K,M,N \gg p^{1/8+\epsilon}$
Shkredov–Shparlinski (Shkredov et al., 2016)	$(BCD)^{3/4}A^{1/2}q^{1/2} + \cdots$	$N \geq q^{2/5+\epsilon}$
Kerr (Kerr, 2014), Pierce (Pierce, 2014)	$|B|^{1-1/r}q^{\cdots}$	$H_i > q_i^{1/k+\epsilon}$
Schoen–Shkredov (Schoen et al., 2020)	$\exp(-c(\log p)^{1/3}/(\log K)^{2/3})|A||B|$	Small doubling $K$, $|A|,|B|$ large

7. Relation to Lower Bounds and Structural Obstructions

Goldmakher–Lamzouri (Goldmakher et al., 2011) unconditionally realize large character sums for odd-order characters via pretentious distance, matching (up to $\epsilon$) conditional GRH bounds. The extremal behavior of mixed character sums is controlled by arithmetic structure, with Paley-type phenomena for quadratic and higher odd orders.

Wang–Xu (Wang et al., 2024) show that the average size over nonprincipal characters for mixed sums with irrational phase is $\sim \sqrt{x}$, while Harper establishes a strict decay $o(\sqrt{x})$ for rational phases—a dichotomy driven by Diophantine properties and the arithmetic distribution of summands.

---

Mixed character sum bounds now constitute a core toolkit for additive number theory and finite field arithmetic, with ongoing advances driven by mean-value theorems, stratification ideas, and higher-moment analytic techniques. Progress in this arena continues to deepen the connections between combinatorial geometry, algebra, and analytic number theory.