On a combinatorial problem of Erdős, Ginzburg, and Ziv (Q1228616)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3520422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a combinatorial problem of Erdős, Ginzburg, and Ziv |
scientific article; zbMATH DE number 3520422 |
Statements
On a combinatorial problem of Erdős, Ginzburg, and Ziv (English)
0 references
1976
0 references
The following theorem is proved. If \(g_1,\ldots,g_{2n-1}\) is a sequence of \(2n-1\) elements in a finite group of order \(n\) (written additively), then there are \(n\) distinct indices \(i_1,\ldots,i_n\) such that \(g_{i_1}+ \ldots + g_{i_n} = 0\). So far the theorem was known only for finite solvable groups.
0 references
zero-sum subsequence
0 references
0.911650002002716
0 references
0.8821468353271484
0 references
0.8819740414619446
0 references
0.8601388335227966
0 references
