Zero-sum problems — A survey
✍ Scribed by Yair Caro
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 964 KB
- Volume
- 152
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Zero-sum Ramsey theory is a newly established area in combinatorics. It brings to ramsey theory algebric tools and algebric flavour. The paradigm of zero-sum problems can be formulated as follows: Suppose the elements of a combinatorial structure are mapped into a finite group K. Does there exists a prescribed substructure the sum of the weights of its elements is 0 in K?
We survey the algebric background necessary to develop the first steps in this area and its short history dated back to a 1960 theorem of Erdos-Ginzburg and Ziv. Then a systematic survey is made to encompass most of the results published in this area until 1.1.95.
Several conjectures and open problems are cited along this manuscript with the hope to catch the eyes of the interested reader.
📜 SIMILAR VOLUMES
In this paper we consider the following open problems: Conjecture 0.1. Let S be a sequence of 3n&3 elements in C n Ä C n . If S contains no nonempty zero-sum subsequence of length not exceeding n, then S consists of three distinct elements, each appearing n&1 times. Conjecture 0.2. Let S be a seque
## Abstract For a graph __G__ whose number of edges is divisible by __k__, let __R__(__G,Z__~k~) denote the minimum integer __r__ such that for every function __f__: __E__(__K__~r~) ↦ __Z__~k~ there is a copy __G__^1^ of __G__ in __K__~r~ so that Σe∈__E__(__G__^1^) __f(e)__ = 0 (in __Z__~k~). We pr
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
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 prese