Remarks on a Zero-Sum Theorem
β Scribed by Yair Caro
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 330 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Recently the following theorem in combinatorial group theory has been proved: Let G be a finite abelian group and let A be a sequence of members of G such that |A| |G| +D(G)&1, where D(G) is the Davenport constant of G. Then A contains a subsequence B such that |B|= |G| and b # B b=0. We shall present a generalization of this theorem which contains information on the extremal cases and in particular allows us to deduce a short proof of the extremal cases in the Erdo s Ginzburg Ziv theorem. We also present, using the above-mentioned theorem, a proof that if G has rank k then |A| |G|(1+(k+1)Γ2 k )&1 suffices to ensure a zero-sum subsequence on |G| terms.
π SIMILAR VOLUMES
A hilarious satire and universal exploration of the origins of power and corruption. A Zero-Sum Game uses the highly-charged election for the presidency of a residents' committee and the influence of a powerful stranger to both expose those in power and to sympathize with individuals who find themse
In this chilling saga of a military/industrial/financial complex run amok, the Zero Sum trilogy pits Dr. Steven Archer against a powerful Wall Street financier in a white collar chess-game that quickly transforms into a cage-fight to the death.