Let G be a group of order m. Define s(G) to be the smallest value of t such that out of any t elements in G, there are m with product 1. The Erdős-Ginzburg-Ziv theorem gives the upper bound s(G) 2m -1, and a lower bound is given by s(G) D(G) + m -1, where D(G) is Davenport's constant. A conjecture b
✦ LIBER ✦
The Erdős-Heilbronn problem in Abelian groups
✍ Scribed by Gyula Károlyi
- Publisher
- The Hebrew University Magnes Press
- Year
- 2004
- Tongue
- English
- Weight
- 397 KB
- Volume
- 139
- Category
- Article
- ISSN
- 0021-2172
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Improving the Erdős–Ginzburg–Ziv theorem
✍
Jared Bass
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 229 KB
On the Erdős-Straus non-averaging set pr
✍
H. L. Abbott
📂
Article
📅
1986
🏛
Akadmiai Kiad
🌐
English
⚖ 137 KB
The Equivariant Serre Problem for abelia
✍
Mikiya Masuda; Lucy Moser-Jauslin; Ted Petrie
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 415 KB
The partition problem for finite abelian
✍
Bernd Voigt
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 720 KB
Near optimal bounds for the Erdős distin
✍
József Solymosi; Van H. Vu
📂
Article
📅
2008
🏛
Springer-Verlag
🌐
English
⚖ 220 KB
The P-DNP Problem for Infinite Abelian G
✍
Christine Gaßner
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 123 KB
We consider a uniform model of computation for groups. This is a generalization of the Blum Shub Smale model over the additive group of real numbers. We show that the inequalities P{DNP and PQ{DNPQ hold for computations with or without parameters over arbitrary infinite abelian groups.