Metraipolis › archive › dc_a098ac8d3cb3
Zero-sum problem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Zero-sum_problem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T20:37:46.240Z
- SHA-256 of the archived text
e4199228c1f350afd31653af5ce8cd407d3adba5363ee418520805448a49bead- Stable URL of this page
https://metraipolis.com/documento/dc_a098ac8d3cb3
How to cite
Zero-sum problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Zero-sum_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a098ac8d3cb3 (Metraipolis archive dc_a098ac8d3cb3, sha256 e4199228c1f350afd31653af5ce8cd407d3adba5363ee418520805448a49bead)
BibTeX
@misc{dca098ac8d3cb3,
title = {Zero-sum problem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Zero-sum_problem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a098ac8d3cb3; sha256 e4199228c1f350afd31653af5ce8cd407d3adba5363ee418520805448a49bead},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Zero-sum_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In number theory, zero-sum problems are certain kinds of combinatorial problems about the structure of a finite abelian group. Concretely, given a finite abelian group G and a positive integer n, one asks for the smallest value of k such that every sequence of elements of G of size k contains n terms that sum to 0. The classic result in this area is the 1961 theorem of Paul Erdős, Abraham Ginzburg, and Abraham Ziv. They proved that for the group Z / n Z {\displaystyle \mathbb {Z} /n\mathbb {Z} } of integers modulo n, k = 2 n − 1. {\displaystyle k=2n-1.} Explicitly this says that any multiset of 2n − 1 integers has a subset of size n the sum of whose elements is a multiple of n, but that the same is not true of multisets of size 2n − 2. (Indeed, the lower bound is easy to see: the multiset containing n − 1 copies of 0 and n − 1 copies of 1 contains no n-subset summing to a multiple of n.) This result is known as the Erdős–Ginzburg–Ziv theorem after its discoverers. It may also be deduced from the Cauchy–Davenport theorem. More general results than this theorem exist, such as Olson's theorem, Kemnitz's conjecture (proved by Christian Reiher in 2003), and the weighted EGZ theorem (proved by David J. Grynkiewicz in 2005).
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Zero-sum problem» — https://en.wikipedia.org/wiki/Zero-sum_problem
Wikidata Q716171 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q716171
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Zero-sum_problem?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 1289979349, consultata il 2026-10-07T19:47:26.981Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: dcdc916cf616ac724a437d4fddaa73e020706fa547f3cc236ba512ac9d7d8d82