Fact-checked by Grok 2 weeks ago

Quadratic Gauss sum

A quadratic Gauss sum is a special type of Gauss sum in number theory, defined for an odd prime p as g_p = \sum_{k=0}^{p-1} \left( \frac{k}{p} \right) e^{2\pi i k / p}, where \left( \frac{k}{p} \right) denotes the Legendre symbol, which equals 1 if k is a quadratic residue modulo p, -1 if a non-residue, and 0 if k \equiv 0 \pmod{p}.^[1]^[2] Introduced by Carl Friedrich Gauss in the early 19th century, these sums play a foundational role in analytic number theory, particularly in the proof of quadratic reciprocity, which relates the solvability of quadratic congruences modulo distinct primes.^[3]^[1] Gauss himself evaluated the sum explicitly: g_p = \sqrt{p} if p \equiv 1 \pmod{4}, and g_p = i \sqrt{p} if p \equiv 3 \pmod{4}, with the square satisfying g_p^2 = \left( \frac{-1}{p} \right) p, where \left( \frac{-1}{p} \right) = (-1)^{(p-1)/2}.^[1]^[2] Beyond reciprocity laws, quadratic Gauss sums appear in the evaluation of character sums over finite fields, the counting of points on elliptic curves, and connections to modular forms and L-functions, underscoring their magnitude |g_p| = \sqrt{p} as a key property linking arithmetic and complex analysis.^[3]^[2] They also generalize to Jacobi sums and higher-degree characters, extending their utility in algebraic number theory and representation theory.^[3]

Definition and Formulation

Classical Definition

The quadratic Gauss sum originated with Carl Friedrich Gauss in his 1801 publication Disquisitiones Arithmeticae, where it emerged in the investigation of quadratic residues modulo prime numbers.^[4] Gauss employed the sum to advance his proofs of quadratic reciprocity, highlighting its role in distinguishing quadratic behaviors within finite fields. In its classical form, the quadratic Gauss sum is defined for an odd prime p and an integer a by the formula

g(a; p) = \sum_{n=0}^{p-1} \zeta_p^{a n^2},

where \zeta_p = e^{2\pi i / p} denotes a primitive p-th root of unity. This exponential sum aggregates the p-th roots of unity weighted by quadratic exponents a n^2 \mod p, thereby encoding the distribution of quadratic forms in the multiplicative group modulo p. If a \equiv 0 \pmod{p}, the sum simplifies to g(a; p) = p, as every exponent vanishes and the terms are all 1. As a prototypical exponential sum, g(a; p) quantifies quadratic phenomena modulo p, such as the imbalance between quadratic residues and non-residues, through its oscillatory nature in the complex plane. The name "quadratic Gauss sum" honors Gauss's foundational contributions to its study and evaluation.^[4] An equivalent formulation expresses it via the Legendre symbol \left( \frac{\cdot}{p} \right), linking it directly to quadratic character sums.

Character-Theoretic Formulation

The character-theoretic formulation of the quadratic Gauss sum abstracts the classical exponential sum by incorporating Dirichlet characters, particularly the quadratic ones, which play a central role in analytic number theory. For an odd prime p, the quadratic Gauss sum associated to the non-trivial quadratic Dirichlet character \chi modulo p—defined by \chi(n) = \left( \frac{n}{p} \right), the Legendre symbol—is given by

g(\chi; p) = \sum_{n=0}^{p-1} \chi(n) \zeta_p^n,

where \zeta_p = e^{2\pi i / p} is a primitive p-th root of unity.^[5] This character \chi takes values in \{0, \pm 1\}, vanishing when p divides n, and satisfies \chi^2 \equiv 1 \pmod{p} with \chi \not\equiv 1.^[3] This formulation relates directly to the classical quadratic Gauss sum g(a; p) = \sum_{n=0}^{p-1} e^{2\pi i a n^2 / p} for a not divisible by p. Specifically, g(a; p) = \chi(a) g(\chi; p), reflecting the multiplicative nature of the character in twisting the exponential sum.^[5] Here, the factor \chi(a) adjusts the phase according to the quadratic residuosity of a modulo p. For a general modulus N \geq 1, the quadratic Gauss sum extends to any quadratic Dirichlet character \chi modulo N, defined as a primitive real character of order dividing 2 (i.e., \chi(n)^2 = 1 for all n coprime to N, and not the principal character). The sum is

G(\chi) = \sum_{a=1}^N \chi(a) e^{2\pi i a / N},

where \chi(a) = 0 if \gcd(a, N) > 1.^[3] Such characters \chi are precisely the Kronecker symbols associated to fundamental discriminants d of quadratic fields \mathbb{Q}(\sqrt{d}), with conductor |d| equal to the absolute value of the discriminant; for example, \chi = \left( \frac{d}{\cdot} \right) induces the character for the ring of integers in the field.^[6] When \chi is primitive (i.e., its conductor equals N), G(\chi) exhibits specific algebraic properties within the N-th cyclotomic field \mathbb{Q}(\zeta_N). In particular, G(\chi) generates a quadratic extension over \mathbb{Q} embedded in \mathbb{Q}(\zeta_N), and its square satisfies G(\chi)^2 = \chi(-1) N, linking it to the field's signature and discriminant structure.^[3] This positioning underscores the sum's role in the Galois theory of cyclotomic extensions adjoining quadratic characters.

Evaluation

Absolute Value

The absolute value of the quadratic Gauss sum associated to a non-trivial quadratic Dirichlet character \chi modulo an odd prime p is given by |g(\chi; p)| = \sqrt{p}.^[7] This result holds for the classical formulation g(\chi; p) = \sum_{k=0}^{p-1} \chi(k) \exp(2\pi i k / p), where \chi is the Legendre symbol modulo p. To derive this, consider |g(\chi; p)|^2 = g(\chi; p) \overline{g(\chi; p)} = g(\chi; p) g(\overline{\chi}; p). For the real-valued quadratic \chi = \overline{\chi}, a change of variables shows |g(\chi; p)|^2 = \sum_{c=0}^{p-1} \exp(2\pi i c / p) \sum_{m=0}^{p-1} \chi(m(m + c)). The inner sum equals \chi(-1) p if c = 0 and 0 otherwise, yielding |g(\chi; p)|^2 = \chi(-1) p. Since |\chi(-1)| = 1, it follows that |g(\chi; p)|^2 = p, so |g(\chi; p)| = \sqrt{p}.^[3] This result extends to the character-theoretic formulation for a primitive quadratic character \chi modulo a general integer N > 1: |G(\chi)| = \sqrt{N}, where G(\chi) = \sum_{a=0}^{N-1} \chi(a) \exp(2\pi i a / N). The proof follows analogously by squaring and applying character orthogonality, with the magnitude depending on the conductor of \chi, which equals N for primitive characters.^[3] In the special case of the standard principal character \chi_0 (where \chi_0(a) = 1 if \gcd(a, N) = 1 and 0 otherwise), G(\chi_0) = \mu(N), where \mu is the Möbius function (e.g., G(\chi_0) = -1 for odd prime N = p). If instead extended constantly to 1 on all residues (non-standard), the sum is 0 for N > 1. Geometrically, the magnitude \sqrt{p} (or \sqrt{N}) of the quadratic Gauss sum reflects the size of the sum in terms of archimedean and non-archimedean norms within the cyclotomic field \mathbb{Q}(\zeta_p), where the algebraic norm of the ideal generated by the sum relates to p.

Explicit Evaluation

The explicit evaluation of the quadratic Gauss sum g(a; p) = \sum_{k=0}^{p-1} \exp\left( \frac{\pi i a k^2}{p} \right) for a prime p and integer a not divisible by p was first determined by Carl Friedrich Gauss. For the principal case a = 1 and odd prime p, Gauss established that g(1; p) = \sqrt{p} if p \equiv 1 \pmod{4} and g(1; p) = i \sqrt{p} if p \equiv 3 \pmod{4}, where \sqrt{p} denotes the positive real square root and i = \sqrt{-1}.^[8] For p = 2, the sum evaluates to g(1; 2) = 1 + i. In the general case, the value simplifies via the Legendre symbol \left( \frac{a}{p} \right), yielding g(a; p) = \left( \frac{a}{p} \right) g(1; p) for a \not\equiv 0 \pmod{p}.[](https://e.math.cornell.edu/people/belk/number theory/GaussSums.pdf) A standard approach to deriving these formulas begins with the relation g(\chi)^2 = \chi(-1) p, where \chi is the quadratic character modulo p (corresponding to g(1; p) up to normalization) and \chi(-1) = (-1)^{(p-1)/2}. This equality follows from properties of Jacobi sums, where J(\chi, \chi) = -\chi(-1) and the relation g(\chi)^2 = J(\chi, \chi) g(\chi_0) \cdot (-p)/g(\chi_0) adjusts for the principal character g(\chi_0) = -1, or alternatively from counting solutions to quadratic congruences x^2 \equiv b \pmod{p} via the sum's Fourier transform properties.^[9]^[3] Combined with the known magnitude |g(1; p)| = \sqrt{p}, this determines g(1; p)^2, but the precise phase requires additional steps, such as relating to the number of points on certain curves or using the functional equation of the L-function associated to \chi.^[1] The phase factor \varepsilon(\chi) = g(\chi) / |g(\chi)| is 1 if p \equiv 1 \pmod{4} and i if p \equiv 3 \pmod{4}, which aligns with the quadratic Hilbert symbol (-1, -1)_p = (-1)^{(p-1)/2} in the context of the local class field theory interpretation of the sum. Modern refinements express quadratic Gauss sums in terms of modular objects, such as the Dedekind eta function \eta(\tau) = q^{1/24} \prod_{n=1}^\infty (1 - q^n) with q = e^{2\pi i \tau}, via transformation laws under the modular group; for instance, g(1; p) appears in the evaluation of \eta(i/p) / \eta(i). These connections underpin Ramanujan's congruences for the partition function, where theta series involving Gauss sums yield identities like p(5n+4) \equiv 0 \pmod{5}, linking the sums to analytic number theory.

Properties

Algebraic and Multiplicative Properties

The quadratic Gauss sum g(\chi; p), where \chi is the Legendre symbol modulo an odd prime p, is an algebraic integer residing in the ring \mathbb{Z}[\zeta_p] of the p-th cyclotomic field \mathbb{Q}(\zeta_p). This placement follows from the definition g(\chi; p) = \sum_{a=1}^{p-1} \chi(a) \zeta_p^a, where each term \chi(a) \zeta_p^a is an algebraic integer, and their sum inherits this property.^[3] Furthermore, g(\chi; p) generates over \mathbb{Q} the unique quadratic subfield of \mathbb{Q}(\zeta_p), which is \mathbb{Q}(\sqrt{(-1)^{(p-1)/2} p}). Let d = (-1)^{(p-1)/2} p; then d \equiv 1 \pmod{4}, and the ring of integers of this subfield is \mathbb{Z}[(1 + \sqrt{d})/2]. Since g(\chi; p)^2 = \chi(-1) p, it follows that g(\chi; p) = \epsilon \sqrt{d} for a suitable fourth root of unity \epsilon, so \mathbb{Z}[g(\chi; p)] = \mathbb{Z}[\sqrt{d}], which is an order of conductor 2 in the full ring of integers. This subfield arises as the fixed field of the index-2 subgroup of the Galois group \mathrm{Gal}(\mathbb{Q}(\zeta_p)/\mathbb{Q}) \cong (\mathbb{Z}/p\mathbb{Z})^\times, reflecting the intrinsic connection between the sum and the arithmetic structure of the extension.^[10] A key multiplicative property holds for quadratic characters with coprime conductors: if \chi_1 and \chi_2 are quadratic Dirichlet characters modulo coprime integers m_1 and m_2, then the Gauss sum for the product character satisfies G(\chi_1 \chi_2) = G(\chi_1) G(\chi_2), provided \chi_1 \chi_2 is primitive modulo m_1 m_2. This multiplicativity extends the behavior over prime moduli to composite settings and underpins factorization in cyclotomic rings.^[3] The Galois group of \mathbb{Q}(\zeta_p)/\mathbb{Q} acts on g(\chi; p) via the Frobenius automorphisms: for k coprime to p, the automorphism \sigma_k defined by \sigma_k(\zeta_p) = \zeta_p^k satisfies \sigma_k(g(\chi; p)) = \chi(k) g(\chi; p). This action highlights the sum's role as an eigenvector under the Galois representation associated to \chi, facilitating computations in subfields.^[11] An essential relation is the square formula:

g(\chi; p)^2 = \chi(-1) \, p,

where \chi(-1) = (-1)^{(p-1)/2} determines the sign and links the sum directly to the discriminant of the quadratic subfield \mathbb{Q}(\sqrt{(-1)^{(p-1)/2} p}). This equation underscores the arithmetic linkage, as the right-hand side generates the prime ideal above p in the subfield's ring of integers.^[3]

Relations to Other Mathematical Objects

Quadratic Gauss sums are closely related to Jacobi sums through explicit algebraic identities. For a quadratic character \chi modulo an odd prime p, the square of the Gauss sum satisfies g(\chi)^2 = -p J(\chi, \chi), where J(\chi, \chi) is the Jacobi sum associated to \chi with both arguments, and J(\chi, \chi) = -\chi(-1).^[3] This relation plays a key role in Stickelberger's theorem, which describes the prime ideal factorization of Gauss sums in the ring of integers of cyclotomic fields.^[12] The classical quadratic Gauss sum g(1; p) = \sum_{k=0}^{p-1} e^{2\pi i k^2 / p} appears prominently in the modular transformation formulas for Jacobi theta functions. Specifically, the transformation law \theta(z \mid -1/\tau) = (-i\tau)^{1/2} e^{i \pi z^2 / \tau} \theta(z/\tau \mid \tau) for the Jacobi theta function \theta(z \mid \tau) = \sum_{n \in \mathbb{Z}} e^{\pi i n^2 \tau + 2\pi i n z} reduces, upon specialization to rational \tau involving p, to expressions involving this Gauss sum, linking analytic properties of theta functions to finite character sums.^[13] In the context of cyclotomic fields, the quadratic Gauss sum g(\chi; p) generates the unique quadratic subfield of the p-th cyclotomic field \mathbb{Q}(\zeta_p), where \zeta_p = e^{2\pi i / p}; this subfield coincides with the maximal real subfield \mathbb{Q}(\zeta_p)^+ when p=5, as both have degree (p-1)/2 = 2 over \mathbb{Q}. In general, the subfield has degree 2 over \mathbb{Q}, and g(\chi; p) adjoins an element whose minimal polynomial is obtained by transforming the p-th cyclotomic polynomial \Phi_p(x) via the substitution relating to the real parts of roots of unity. Quadratic Gauss sums connect to class numbers through the arithmetic of ray class fields, particularly via the factorization of the different ideal. Stickelberger's theorem implies that the prime ideals dividing the Gauss sum determine the splitting behavior in ray class fields over cyclotomic extensions, which in turn influences formulas for the class number of the maximal real subfield, such as in computations for small primes where the class number is 1.^[12] Beyond these, quadratic Gauss sums relate to other character sums like Kloosterman sums through applications of the Poisson summation formula. In estimates for representation numbers of quadratic forms, the Poisson summation over lattices yields transforms involving quadratic Gauss sums alongside quadratic Kloosterman sums K_2(a, b; c) = \sum_{(d,c)=1} \left( \frac{d}{c} \right) e^{2\pi i (a d + b d^{-1}) / c}, providing quadratic-specific bounds essential for analytic number theory. Similar connections arise with Ramanujan sums in generalizations over quadratic fields, where Gauss sums aid in explicit evaluations.^[14]

Applications

In Quadratic Reciprocity

Quadratic Gauss sums play a pivotal role in Carl Friedrich Gauss's sixth proof of the law of quadratic reciprocity, developed around 1805 and published in 1811 as part of his investigations into cyclotomic fields and reciprocity laws.^[15] This proof leverages the algebraic properties of Gauss sums to establish the relationship between the Legendre symbols \left( \frac{p}{q} \right) and \left( \frac{q}{p} \right) for distinct odd primes p and q, marking an early analytic approach in number theory that connected sums over roots of unity to reciprocity.^[16] The core of the proof involves evaluating the product of two quadratic Gauss sums, g(1;p) = \sum_{n=1}^{p-1} \left( \frac{n}{p} \right) \zeta_p^n and g(1;q) = \sum_{m=1}^{q-1} \left( \frac{m}{q} \right) \zeta_q^m, where \zeta_p = e^{2\pi i / p} and \zeta_q = e^{2\pi i / q}. A key identity relates this product to a Gauss sum modulo pq: specifically, g(1;p) g(1;q) = \left( \frac{q}{p} \right) g(1;pq), up to a factor involving the sign of the sums.^[16] Since the absolute value of each quadratic Gauss sum is \sqrt{p} and \sqrt{q} respectively, the normalized product g(1;p) g(1;q) / \sqrt{pq} equals \left( \frac{p}{q} \right) \left( \frac{q}{p} \right)^{1/2} times a fourth root of unity determined by the explicit evaluation of the sums. Equating this to an alternative expression derived from the sum over \mathbb{F}_{pq} yields \left( \frac{p}{q} \right) \left( \frac{q}{p} \right) = (-1)^{(p-1)/2 \cdot (q-1)/2}, confirming the reciprocity law.^[16] This method offers a distinct advantage over Euler's earlier proof from 1781, which relied on infinite descent and combinatorial arguments to handle cases modulo 4. In contrast, Gauss's approach employs complex exponentials and properties of roots of unity, providing a more unified analytic framework that avoids case-by-case descent and highlights the multiplicative structure of the sums.^[16] In modern number theory, the Gauss sum technique has been adapted in Eisenstein's simplifications of reciprocity proofs during the 1840s and extended to the Hasse local-global principle for quadratic forms, where sums facilitate local solvability checks over finite fields via character sums.^[17] These variants underscore the enduring utility of quadratic Gauss sums in bridging elementary reciprocity with broader arithmetic geometry.^[17]

In Analytic Number Theory

Quadratic Gauss sums play a pivotal role in the analytic theory of Dirichlet L-functions associated with quadratic characters. For a primitive quadratic Dirichlet character \chi modulo N, the completed L-function is defined as \Lambda(s, \chi) = (N/\pi)^{s/2} \Gamma(s/2 + a/2) L(s, \chi), where a = 0 if \chi is even and a = 1 if \chi is odd, corresponding to \chi(-1) = 1 or \chi(-1) = -1. This function satisfies the functional equation \Lambda(s, \chi) = \varepsilon(\chi) \Lambda(1-s, \bar{\chi}), with the root number \varepsilon(\chi) = G(\chi) / (i^a \sqrt{N}), where G(\chi) is the Gauss sum \sum_{k=1}^N \chi(k) e^{2\pi i k / N}.^[18]^[19] The Gauss sum enters crucially in determining the root number, which governs the symmetry of the L-function and influences the distribution of its zeros. For quadratic \chi, since \chi = \bar{\chi}, the equation simplifies, and |\varepsilon(\chi)| = 1, ensuring the analytic continuation of L(s, \chi) to the entire complex plane as an entire function of order 1. This structure, derived from the Poisson summation formula applied to theta functions twisted by \chi, underscores the Gauss sum's role in bridging elementary character sums to advanced analytic properties.^[20]^[21] At special values, particularly s=1, the L-function relates directly to arithmetic invariants via the class number formula. For a fundamental discriminant d < 0, the class number h(d) of the imaginary quadratic field \mathbb{Q}(\sqrt{d}) is given by h(d) = \frac{w \sqrt{|d|}}{2\pi} L(1, \chi_d), where w is the number of units in the ring of integers (typically w=2, except w=4 for d=-4 or w=6 for d=-3), and \chi_d(n) = \left( \frac{d}{n} \right) is the Kronecker symbol. The Gauss sum G(\chi_d) = i \sqrt{|d|} for odd characters (as in imaginary quadratics) factors into the normalization constant in the residue computation, linking the sum to the Dedekind zeta function's pole.^[22]^[23] For positive d, a similar formula holds with real quadratic fields, where L(1, \chi_d) involves the fundamental unit, and G(\chi_d) = \sqrt{d}.^[24] In applications to prime distribution, the Euler product for L(s, \chi) = \prod_p (1 - \chi(p) p^{-s})^{-1} incorporates the quadratic character, with Gauss sums aiding in the non-vanishing of L(1, \chi) for non-principal \chi, as established by the class number formula providing a positive lower bound. This ensures the density of primes in quadratic progressions, as per Dirichlet's theorem, where the relative density is $1/\phi(N) adjusted by the residue class.^[25] Modern developments extend quadratic Gauss sums to spectral theory, particularly in trace formulas for automorphic forms on GL(2) twisted by quadratic characters. These twists appear in multiple Dirichlet series summing L-functions L(s, \pi \times \chi_d), where G(\chi_d) normalizes the intertwining operators and contributes to meromorphic continuations, facilitating subconvexity bounds and moments in the Langlands program.^[26]

Generalizations

Modulo Composite Integers

The quadratic Gauss sum modulo a composite integer N > 1 is defined using the quadratic Dirichlet character \chi modulo N, which for odd square-free N is given by the Kronecker symbol \left( \frac{\cdot}{N} \right), extending the Jacobi symbol to define the quadratic residue symbol. The sum is then G(\chi; N) = \sum_{a=0}^{N-1} \chi(a) e^{2\pi i a / N}, where \chi(a) = 0 if \gcd(a, N) > 1.^[3]^[27] By the Chinese Remainder Theorem, quadratic Gauss sums are multiplicative over coprime factors of the modulus. Specifically, if N = pq with p, q distinct odd primes, then \chi = \chi_p \chi_q where \chi_p, \chi_q are the quadratic characters modulo p, q, and G(\chi; N) = G(\chi_p; p) G(\chi_q; q). This extends to general coprime factorizations of N, allowing reduction to prime power cases.^[3]^[28] For a primitive quadratic character \chi modulo N, the magnitude is |G(\chi; N)| = \sqrt{N}. The explicit value includes a sign determined by the product of local epsilon factors \varepsilon_p from the prime power components of N, where each \varepsilon_p is the normalized sign of the prime modulus Gauss sum (1 if p \equiv 1 \pmod{4}, i if p \equiv 3 \pmod{4}, with adjustments for powers of 2). For example, G(\chi; N)^2 = \chi(-1) N.^[3] A generalized form is G(a, b, c) = \sum_{n=0}^{c-1} e^{2\pi i (a n^2 + b n)/c}, valid for integers a, b, c with c > 0. Assuming \gcd(a, c) = 1, completion of the square yields G(a, b, c) = \left( \frac{a}{c} \right) e^{\pi i b^2 / (4 a c)} G(1, 0, c), where \left( \frac{a}{c} \right) is the Jacobi or Kronecker symbol as appropriate.^[28] These sums depend on residue classes modulo c; for instance, G(1, 0, c) = 0 if c \equiv 2 \pmod{4}, and more generally vanish if c is even and a is odd in ways incompatible with the character definition (e.g., when the quadratic form lacks solutions modulo 4).^[28]

Incomplete and Higher-Dimensional Variants

Incomplete quadratic Gauss sums arise when the summation in the classical definition is truncated to a partial range, rather than over a complete residue system modulo p. A typical form is the incomplete sum S(H; p) = \sum_{n=1}^{H} \exp(2\pi i a n^2 / p), where p is an odd prime, a is coprime to p, and $1 \leq H < p. These sums approximate the complete quadratic Gauss sum plus an error term, with the approximation improving as H grows relative to p. For instance, when H \approx p^{1/2 + \epsilon} for small \epsilon > 0, asymptotic expansions express S(H; p) in terms of the complete sum scaled by factors involving cotangents and higher-order polynomials, with error O(p^{2H - 3}).^[29] Bounds for incomplete quadratic Gauss sums often rely on techniques like Weyl differencing, which reduces the sum to shorter exponential sums by squaring and differencing the phases, leading to estimates of the form |S(H; p)| \ll \sqrt{p \log p} under suitable conditions on H. Vinogradov's method further refines these by iterating differencing and applying mean value theorems, yielding improved bounds such as |S(H; p)| \ll H^{1/2} p^{1/4 + o(1)} for H \ll p^{1/2}, with explicit versions available for prime moduli. These estimates connect to discrepancy theory, where incomplete Gauss sums measure the irregularity of quadratic sequences modulo p, providing tools to bound the discrepancy of point sets in the unit square derived from such sequences.^[30]^[31] Higher-dimensional variants generalize the quadratic Gauss sum to sums over vectors in (\mathbb{Z}/p\mathbb{Z})^k, defined as G(Q; p) = \sum_{x \in (\mathbb{Z}/p\mathbb{Z})^k} \exp(2\pi i Q(x)/p), where Q is a quadratic form on k variables with associated symmetric matrix of determinant \Delta. For non-degenerate Q (i.e., \Delta \not\equiv 0 \pmod{p}), the evaluation yields G(Q; p) = \epsilon(Q) p^{k/2}, where \epsilon(Q) is a complex factor of absolute value 1 depending on the parity of k and the Legendre symbol (\Delta / p); specifically, for even k, \epsilon(Q) = (\Delta / p)^{(k/2 - 1)/2} (1 + i^k), and adjustments apply for odd k. This result extends the classical case via diagonalization of Q modulo p, reducing to products of one-dimensional Gauss sums.^[32] For binary quadratic forms Q(x,y) = ax^2 + bxy + cy^2 with discriminant d = b^2 - 4ac < 0, the associated Gauss sum G(Q; \chi_d; p) links to the number of representations r(n) of integers n by Q, via the approximation r(n) \approx \frac{4\pi}{\sqrt{|d|}} [L(1, \chi_d)](/page/Dirichlet_L-function) \sum_{m=1}^\infty \frac{G(\chi_d, m)}{m} J_1(2\pi \sqrt{nm}/\sqrt{|d|}), where \chi_d is the Kronecker symbol, L(1, \chi_d) is the Dirichlet L-function, and J_1 is the Bessel function; the leading term involves the normalized Gauss sum G(\chi_d)/\sqrt{|d|}. This connection arises from theta series expansions and Poisson summation, enabling asymptotic counts of lattice points on ellipsoids defined by Q.^[32] In modern applications, quadratic Gauss sums, including incomplete and higher-dimensional forms, appear in quantum algorithms for estimation over finite fields, where variants of Shor's algorithm compute approximations to Gauss sums in O(\mathrm{poly}(\log p)) time, aiding discrete logarithm problems in cryptographic settings. Similarly, in coding theory, character sums generalizing quadratic Gauss sums bound the size of error-correcting codes over finite fields, such as in the McEliece cryptosystem or algebraic-geometric codes, where the exact magnitude |G(Q; p)| = p^{k/2} and more general Weil bounds on exponential sums inform code parameters and minimum distances. The value distribution of incomplete sums follows a limit law given by periodic functions, complementing pointwise bounds and facilitating probabilistic analyses in these contexts.^[33]^[34]^[35]

References

[1]
[PDF] The quadratic Gauss sum redux - Home | Department of Mathematics
The purpose of this note is to present a variety of proofs of (1) (some well known and others perhaps less so), using techniques from different branches of.
[2]
[PDF] An Introduction to Gauss and Jacobi Sums in Number Theory
Feb 7, 2023 · ... sum is often written simply as ga or g. If χ is “quadratic”, or of order 2, then ga(χ) is a quadratic Gauss sum. For example, when χ is the ...Missing: mathematics | Show results with:mathematics
[3]
[PDF] Gauss and Jacobi sums on finite fields and Z/mZ - Keith Conrad
For both Fq and Z/mZ, two important sums associated to multiplicative characters on them are Gauss sums and Jacobi sums.
[4]
Disquisitiones arithmeticae : Gauss, Carl Friedrich, 1777-1855
Aug 11, 2018 · Publication date: 1801. Topics: Number theory. Publisher: Lipsiae : In commiss. apud Gerh. Fleischer, jun. Collection: smithsonian.
[5]
[PDF] Chapter 3 Characters and Gauss sums
χ(ga) = S, since ga runs through the elements of A. Hence S = 0. 3.2 Dirichlet characters. Let q ∈ Z⩾2. Denote the residue class of a mod q by a.
[6]
[PDF] 1. legendre, jacobi, and kronecker symbols
Conversely, given any primitive quadratic character χ, there exists a unique fundamental discriminant D such that χ = χD. The proof of this theorem can be found ...
[7]
A Classical Introduction to Modern Number Theory - SpringerLink
Mar 9, 2013 · A Classical Introduction to Modern Number Theory. Textbook; © 1982. 1st edition; View latest edition.
[8]
[PDF] Gauss Sums
p has an equal number of quadratic residues and quadratic non-residues. It follows that gp(1)2 = 0, so the sum of the coefficients in gp(x)2 is equal to 0.
[9]
[PDF] EVALUATION OF THE QUADRATIC GAUSS SUM
May 17, 2017 · For further reading on Gauss sums, we refer the reader to [2] and [3]. In this article, we focus on the quadratic Gauss sum, namely,. G(2) = n−1.
[10]
[PDF] Cyclotomic Fields with Applications - G Eric Moorhouse
These applications include algorithms for fast arithmetic with polynomials and integers; constructions and nonexistence results for Hadamard matrices, ...
[11]
None
### Summary of Quadratic Gauss Sums and Related Properties in Cyclotomic Fields
[12]
[PDF] MATH 361: NUMBER THEORY — NINTH LECTURE 1. Algebraic ...
The ring of integers Z in the rational number field Q has a natural analogue ... unique quadratic subfield. To describe this field, let p∗ = (−1)(p−1)/2p ...
[13]
[PDF] Evaluation of the quadratic Gauss sum
We connect the quadratic Gauss sum G(2) with the Legendre symbol in the following lemma. Lemma 4.1. Let p be an odd prime and (m, p) = 1. Define A(p, m) = (ζmrs.
[14]
[PDF] Powers of Gauss sums in quadratic fields - arXiv
Jul 1, 2021 · This class of Gauss sums is a generalization of index 2 Gauss sums and an extension of pure Gauss sums to quadratic fields. 1. Introduction. Let ...
[15]
Powers of Gauss sums in quadratic fields - ScienceDirect
In this paper, we study Gauss sums, some integral powers of which are in quadratic fields. This class of Gauss sums is a generalization of index 2 Gauss sums.
[16]
[PDF] Gauss-Jacobi Sums and Stickelberger's Theorem
In this article we shall prove Stickelberger's theorem using factorisation of Gauss sums. This theorem tells us about certain elements of the integral.
[17]
[PDF] Theta Functions and Reciprocity Laws - arXiv
Oct 20, 2019 · the transformation formula of the Riemann theta function on the Siegel upper half-space. ... quadratic Gauss sum modulo n. Next, we define ...
[18]
[PDF] modular invariants for real quadratic fields and kloosterman sums
Oct 16, 2024 · In this section we relate the real quadratic invariants to Kloosterman sums and show how ... Applying Poisson summation modulo c to the sum over ...<|control11|><|separator|>
[19]
[PDF] VIII.2 Gauss Sums
Concerning the readers of the Disquisitiones Arithmeticae mentioned in the letter, the “Le Blanc” to whom Gauss refers was Sophie Germain. For more details.
[20]
[PDF] Quadratic Reciprocity via Gauss sums - Williams College
Quadratic Reciprocity is concerned with the Legendre symbol, so henceforth we work with the character.
[21]
[PDF] Quadratic Reciprocity and the Sign of the Gauss Sum via the Finite ...
Feb 22, 2010 · We give new proofs of two basic results in number theory: the law of quadratic reci- procity and the sign of the Gauss sum.
[22]
[PDF] Analytic continuation, functional equation: examples 1. Dirichlet L ...
Oct 24, 2018 · The discussion of L-functions L(s, χ) for Dirichlet characters (over Q) bifurcates into two families, depending upon the parity of χ, that is, ...<|control11|><|separator|>
[23]
Functional equations for Dirichlet L-functions - Kiran S. Kedlaya
in order to evaluate ∑ n = 1 N e 2 π i n 2 / N for N a positive integer. Then use this to compute G ( χ ) for χ the quadratic character .
[24]
[PDF] L(s, χ) as an entire function; Gauss sums
|τ(χ)|: Proposition. The Gauss sum τ(χ) of any primitive Dirichlet character χ mod q has absolute value q1/2. Proof : We obtain this as a special case of the ...
[25]
[PDF] evaluating gauss sums via poisson summation - Williams College
Mar 24, 2022 · For any primitive χ (mod q) we have |τ(χ)| = √ q (or equivalently, |Cχ| = |χ|). Proof. Expanding the modulus squared, making the change of ...Missing: chi sqrt(
[26]
[PDF] The ideal class number formula for an imaginary quadratic field
... quadratic character, such as arises from an imaginary quadratic field, then the basic Gauss sum of a quadratic character is τ(χF ) = iδ|DF |1/2. Returning ...
[27]
[PDF] Math 229: Introduction to Analytic Number Theory Formulas for L(1,χ ...
The Dirichlet class number formula then asserts in effect that = h. 0 where 0 is the fundamental unit of that real quadratic field and h is its class number.<|control11|><|separator|>
[28]
GAUSS' CLASS NUMBER PROBLEM FOR IMAGINARY ...
THEOREM (DIRICHLET). L(l, X) = 27rh(D)/wy/\D\. This is Dirichlet's famous class number formula, which was conjectured in simpler form by Jacobi [24, 7] in 1832 ...
[29]
[PDF] The Gauss Class-Number Problems
In Article 303, Gauss conjectures that as k runs through the complex quadratic fields (i.e., d < 0), h(k) → ∞. He also surmises that for low class-numbers, his.
[30]
[PDF] Multiple Dirichlet Series and Automorphic Forms - Gautam Chinta
Abstract. This article gives an introduction to the multiple Dirichlet series arising from sums of twisted automorphic L-functions. We begin by explaining.
[31]
[PDF] arXiv:1902.10987v3 [math.NT] 16 Jan 2020
Jan 16, 2020 · This generalizes a result of Conrey, Farmer and Soundararajan [3] on quadratic Dirichlet character sums. Mathematics Subject Classification ...Missing: "number | Show results with:"number
[32]
[PDF] Incomplete higher order Gauss sums - UCSD Math
The first object of this paper is to extend the asymptotic estimate (1.5) of Sullivan and Zannier to the incomplete Gauss sums Sm B of order m for each fixed m ...
[33]
Bounding short exponential sums on smooth moduli via Weyl ...
Jun 22, 2013 · It now also appears that further optimisation of this Weyl differencing trick could lead to noticeable improvements in the numerology for the ...
[34]
[1706.05651] Incomplete Gauss sums modulo primes - arXiv
Jun 18, 2017 · We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to ...
[35]
[PDF] Quadratic Form Gauss Sums
Dec 21, 2012 · ... Gauss sum, with a root of unity as a factor. As such, further ... Apostol. Introduction to Analytic Number Theory. Springer-Verlag ...
[36]
[PDF] Quantum Algorithms for Estimating Gauss Sums and Calculating ...
Abstract. An efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings is presented. Also a quantum algorithm.
[37]
[quant-ph/0003107] Gauss Sums and Quantum Mechanics - arXiv
Mar 22, 2000 · A new proof of the Landsberg-Schaar identity for quadratic Gauss sums is given. In contrast to existing non-elementary proofs, which use infinite sums.
[38]
[1207.1607] The value distribution of incomplete Gauss sums - arXiv
Jul 6, 2012 · We prove a limit law for the value distribution of such incomplete Gauss sums. The limit distribution is given by the distribution of a certain ...