Metraipolis › archive › dc_238807addf89

Additive combinatorics — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Additive_combinatorics
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T14:40:12.199Z
SHA-256 of the archived text
ca2691c89e9a2724336d50495d1e3cbf445a52bdb079f3ece889d701a1a41abd
Stable URL of this page
https://metraipolis.com/documento/dc_238807addf89

How to cite

Additive combinatorics — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Additive_combinatorics (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_238807addf89 (Metraipolis archive dc_238807addf89, sha256 ca2691c89e9a2724336d50495d1e3cbf445a52bdb079f3ece889d701a1a41abd)
BibTeX
@misc{dc238807addf89,
  title = {Additive combinatorics — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Additive_combinatorics},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_238807addf89; sha256 ca2691c89e9a2724336d50495d1e3cbf445a52bdb079f3ece889d701a1a41abd},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Additive_combinatorics. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are inverse problems: given the size of the sumset A + B is small, what can we say about the structures of A and B? In the case of the integers, the classical Freiman's theorem provides a partial answer to this question in terms of multi-dimensional arithmetic progressions. Another typical problem is to find a lower bound for |A + B| in terms of |A| and |B|. This can be viewed as an inverse problem with the given information that |A + B| is sufficiently small and the structural conclusion is then of the form that either A or B is the empty set; however, in literature, such problems are sometimes considered to be direct problems as well. Examples of this type include the Erdős–Heilbronn Conjecture (for a restricted sumset) and the Cauchy–Davenport Theorem. The methods used for tackling such questions often come from many different fields of mathematics, including combinatorics, ergodic theory, analysis, graph theory, group theory, and linear-algebraic and polynomial methods.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «Additive combinatorics» — https://en.wikipedia.org/wiki/Additive_combinatorics
Wikidata Q56313053 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q56313053
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Additive_combinatorics?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1314274977, consultata il 2026-10-15T14:00:00.942Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 7bd45d14ec9174c3bacc7a060060f6653dea46e9baabdd04748f147ba1dbb9cc