On a combinatorial problem of Erdős, Ginzburg, and Ziv (Q1228616): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5841589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two addition theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addition theorem for finite abelian groups / rank
 
Normal rank

Latest revision as of 19:14, 12 June 2024

scientific article
Language Label Description Also known as
English
On a combinatorial problem of Erdős, Ginzburg, and Ziv
scientific article

    Statements

    On a combinatorial problem of Erdős, Ginzburg, and Ziv (English)
    0 references
    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
    0 references
    0 references
    zero-sum subsequence
    0 references