Rédei's theorem

Rédei's theorem
Name	Rédei's theorem
Field	Number theory, Combinatorics, Graph theory
Named after	László Rédei
First proved	1940s

Rédei's theorem is a result in number theory and combinatorics linking arithmetic structure of rational numbers and combinatorial properties of finite sets, with consequences for additive number theory, finite fields, and graph theory. The theorem originally arose from investigations by László Rédei into polynomial factorization over finite fields and additive bases, and has been adapted in proofs involving Cauchy–Davenport theorem, Erdős–Ginzburg–Ziv theorem, Vosper's theorem, and structural results used by researchers such as Paul Erdős, Pál Erdős (note: Pál Erdős is distinct), and Károly Rédei contemporaries.

Statement of Rédei's theorem

Rédei's theorem describes structural constraints on finite subsets of integers or finite fields when sumset or product-set sizes are small relative to the original set, often formulated: if A is a finite subset of a prime field 𝔽_p with |A+A| unusually small then A is close to an arithmetic progression or coset of a subgroup; similarly, when polynomial factorization over 𝔽_p yields few linear factors, one obtains restrictions on coefficient structure. Typical formulations reference the Cauchy–Davenport theorem, Vosper's theorem, and the concept of small doubling by connecting to results by Jean-Pierre Serre, John T. Tate, and Harald Cramér in additive contexts.

Historical context and motivations

Rédei's work grew from mid-20th-century developments in algebraic number theory and finite arithmetic, influenced by problems studied by Richard Dedekind, Emil Artin, Helmut Hasse, and Ernst Kummer about factorizations and class groups. Motivations included decompositions of polynomials over finite fields related to the Weil conjectures era research by André Weil and applications in combinatorial number theory pursued by Paul Erdős, Endre Szemerédi, Pál Turán, and later by Freiman and Melvyn B. Nathanson. Connections to additive bases and sum-free sets linked Rédei's observations to Erdős–Heilbronn conjecture efforts and to structural inverse problems championed by Imre Z. Ruzsa and Terence Tao.

Proofs and methods

Proof techniques for Rédei-type statements draw on tools from finite field theory such as properties of polynomial factorization, Gauss sums, and additive combinatorics instruments like the Cauchy–Davenport theorem, Plünnecke–Ruzsa inequalities, and the Freiman theorem. Alternative proofs invoke graph theory methods including analysis of incidence graphs akin to approaches by Paul Erdős and Alfred Rényi and algebraic geometry inputs reminiscent of Alexander Grothendieck's influence on finite field techniques. Work by Imre Z. Ruzsa, Ben Green, Terry Tao, and Melvyn B. Nathanson refined combinatorial arguments and connected Rédei's conclusions to structural inverse theorems such as Freiman's theorem and results by Oded Schramm and Jean Bourgain.

Applications and consequences

Rédei's theorem has been applied to problems in cryptography using finite field structure studied by researchers at institutions like Bell Labs and IBM Research, and to combinatorial designs and coding theory tied to Claude Shannon and Richard Hamming ideas. Consequences include bounds for sumset sizes used in proofs related to the Erdős–Ginzburg–Ziv theorem, structure theorems feeding into work by Ben Green and Terence Tao on arithmetic progressions, and factorization restrictions relevant to finite geometry constructions by János Bolyai-inspired researchers and modern contributors such as Peter J. Cameron and László Lovász. Rédei-type insights also inform computational complexity questions explored in collaborations involving Stephen Cook and Richard Karp.

Examples and computations

Common examples illustrating Rédei's conclusions use small subsets A of 𝔽_p with explicit computations showing |A+A| minimal, comparing to arithmetic progressions such as sets derived from Gaussian integers embeddings, or cosets of multiplicative subgroups generated by elements studied by Évariste Galois and Niels Henrik Abel. Numerical demonstrations often reference primes studied in work by Srinivasa Ramanujan, G. H. Hardy, and modern computational verifications by teams at University of Cambridge and Princeton University employing algorithms related to Berlekamp's algorithm and Cantor–Zassenhaus algorithm.

Generalizations and related results

Generalizations of Rédei's theorem extend to nonprime finite rings, modules over Z/mZ studied by Norbert Wiener-inspired signal analysts, and higher-dimensional analogues connected to Elekes-type sum-product phenomena investigated by György Elekes and collaborators such as László Pyber. Related results include Vosper's theorem, Cauchy–Davenport theorem, Freiman's theorem, inverse sumset theorems by Melvyn B. Nathanson and Imre Z. Ruzsa, and structural contributions by Jean Bourgain, Ben Green, and Terence Tao on additive combinatorics. Modern research ties Rédei-style structure theorems to arithmetic combinatorics programs at institutions like Institute for Advanced Study and groups led by figures such as Timothy Gowers and Andrew Wiles.

Category:Theorems in number theory