This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Gaussian periods | |
|---|---|
| Name | Gaussian periods |
| Field | Number theory |
| Introduced | 19th century |
| Notable | Carl Friedrich Gauss |
Gaussian periods are algebraic sums arising from the partition of roots of unity into cosets under a subgroup of the multiplicative group of integers modulo a prime power. They were introduced in the work of Carl Friedrich Gauss and feature prominently in the study of cyclotomic fields, class field theory, and explicit constructions of regular polygons. Gaussian periods connect to cyclotomy, Gauss sums, and reciprocity laws and have influenced developments in algebraic number theory and finite geometry.
A Gaussian period is formed by summing selected primitive nth roots of unity according to the action of a subgroup of the multiplicative group modulo n, producing algebraic integers that generate subfields of cyclotomic extensions. The construction is rooted in the analysis of cyclotomic polynomials and the decomposition of Galois groups in works associated with Carl Friedrich Gauss, Évariste Galois, Leopold Kronecker, Richard Dedekind, and Ernst Kummer. Fundamental properties include norm relations, trace formulas, and integrality conditions that reflect results from Bernhard Riemann-type investigations and explicit class field theory as developed by David Hilbert and Emil Artin. Gaussian periods satisfy minimal polynomial relations connected to the resolvent techniques used by Niels Henrik Abel and Évariste Galois.
Given a prime p and an integer k dividing p-1, one forms periods by partitioning the group of units modulo p into k cosets and summing primitive pth roots over each coset; classical examples appear in Gauss’s construction of the regular 17-gon and the 257-gon described by Carl Friedrich Gauss and later treatments by Pierre Wantzel and Camille Jordan. Concrete low-degree examples include the quadratic periods linked to quadratic Gauss sums studied by Adrien-Marie Legendre and the cubic and quartic periods appearing in works of G. H. Hardy and John Edensor Littlewood. Explicit small-prime examples are treated in expositions by Heinrich Weber and Leopold Kronecker, while computational illustrations appear in tables compiled by H. S. Vandiver and summarized in monographs by D. H. Lehmer.
Gaussian periods generate subfields of cyclotomic fields and provide explicit elements whose fields coincide with class fields described in the Kronecker–Weber theorem and later expansions by Helmut Hasse and Heinrich Weber. Their connection to Gauss sums is central: classical Gauss sums relate characters of finite fields to exponential sums over roots of unity, topics explored by Carl Ludwig Siegel, John Tate, and Emil Artin. Periods furnish explicit normal bases in cyclotomic extensions, and their Galois action is described using techniques from Évariste Galois theory and the studies of decomposition by Richard Dedekind. Relations between periods and L-series appear in analytic investigations by Bernhard Riemann and consequences in class number formulas studied by Heegner, Stark, and H. Stark.
Gaussian periods have been applied to construct optimal cyclic difference sets and combinatorial designs in the literature of Raj Chandra Bose, Raymond Paley, and M. Hall Jr.; they underpin explicit constructions of Hadamard matrices and Singer difference sets as treated by L. D. Baumert and J. H. van Lint. In primality testing and explicit reciprocity, periods inform techniques developed by Adleman–Pomerance–Rumely and algorithms of Carl Pomerance and Gary L. Miller. Periods also play roles in coding theory and sequence design studied by Marshall Hall Jr. and Rudolf Lidl, with ties to finite field constructions used in cryptographic primitives analyzed by Whitfield Diffie and Martin Hellman. Combinatorial identities involving periods occur in enumerative contexts discussed by Paul Erdős and in finite geometry results of J. Singer.
Explicit formulas for Gaussian periods use discrete Fourier analysis on cyclic groups and evaluations of Gauss and Jacobi sums, techniques advanced by Iwaniec and Henryk Iwaniec in analytic number theory contexts, and computational strategies developed by Eric Bach, Richard Brent, and D. H. Lehmer. For small indices, radicals and nested square roots provide closed forms as in Gauss’s polygons constructions, later systematized by John Conway and Michael Guy. Algorithms for evaluating periods efficiently exploit multiplicative character transforms and fast Fourier methods related to work by James Cooley and John Tukey; implementations appear in computational algebra systems influenced by Richard Fateman and libraries maintained by contributors to projects originated by Donald Knuth.
Generalizations include Jacobi periods, Gaussian periods over finite fields of nonprime order, and multi-dimensional analogues connecting to Eisenstein sums and complex multiplication theories developed by Goro Shimura and Yutaka Taniyama. Higher-order periods relate to the study of cyclotomic units, Sinnott’s work on higher Stickelberger elements, and advancements in Iwasawa theory by Kenkichi Iwasawa and John Coates. Extensions into the realm of automorphic forms and Langlands program perspectives are discussed by Robert Langlands and informed by research of Andrew Wiles and Richard Taylor in modularity and cyclotomic deformation contexts.