Freiman's theorem, in additive combinatorics, describes the structure of finite sets of integers whose sumset is not much larger than the set itself. It states that if a finite set A of integers satisfies |A+A| at most K times |A| for some constant K, then A must be contained in a generalized arithmetic progression whose dimension and size depend only on K, not on A itself; Gregory Freiman proved the result in 1964, Imre Ruzsa gave a widely used alternative proof in the early 1990s, and Mei-Chu Chang and Tom Sanders later improved its quantitative bounds. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Freiman's theorem (Wikipedia)
Sources
1. Freiman's theorem (Wikipedia)
In Branch: Combinatorics, Lead sentenceQuote, In Branch: Combinatorics, Lead sentence
In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.