𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Zero-sum problems with congruence conditions

✍ Scribed by Alfred Geroldinger; David J. Grynkiewicz; Wolfgang A. Schmid

Book ID
106343899
Publisher
Akadmiai Kiad
Year
2011
Tongue
English
Weight
729 KB
Volume
131
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Zero-sum problems with subgroup weights
Zero-sum problems with subgroup weights
✍ S. D. Adhikari; A. A. Ambily; B. Sury πŸ“‚ Article πŸ“… 2010 πŸ› Indian Academy of Sciences 🌐 English βš– 125 KB
Zero-sum problems β€” A survey
Zero-sum problems β€” A survey
✍ Yair Caro πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 964 KB

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

On three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type problems
✍ Noga Alon; Yair Caro πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 821 KB

## 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

Two Zero-Sum Problems and Multiple Prope
Two Zero-Sum Problems and Multiple Properties
✍ W.D Gao πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 163 KB

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