 About 599 results  books.google.com Hedetniemi conjecture) equivalent interpretations I03Cxx; 03Cxx] (see: Fraisse
characterization of elementary ... principle: ErdosHeilbronn problem: Fermat little
theorem: Graph theory: Ramsey theorem) ErdosHeilbronn conjecture [05C55. 

 books.google.com + a/,i : a, e A, fori  0, 1, . . . , A — 1 and a, ^a; for i y y'}. Then It follows from
Theorem 3.7 than /1AA > \C\ C c /iA/t. /,l > min{/>, 2_^k, , I 2 1 + 1)  min = minfp,
hk — h2 + 1}. This completes the polynomial proof of the ErdosHeilbronn
conjecture. 

 books.google.com As we will see, it can be proved quite easily use the Combinatorial
Nullstellensatz. Taking two arithmetic progressions of common difference shows
that the bound is tight. Theorem 22.5 (The ErdösHeilbronn Conjecture). Let p be
a prime and ... 

 books.google.com Erdos Number numbers > 5 which are divisible by 5 (every fifth number). ... Erdos
Heilbronn Conjecture Erdos and Heilbronn (Erdos and Graham 1980) posed the
problem of estimating from below the number of sums a'b where a #A and b#B ... 

 books.google.com Melvyn B. Nathanson, Ballot numbers, alternating products, and the Erdos
Heilbronn conjecture, The Mathematics of Paul Erdos, I 199217, Algorithms
Combin., 13 Springer Berlin 1997; MR 97ill008. Melvyn B. Nathanson, Additive
number ... 

 books.google.com For the extended ReedSolomon codes RSq (Fq ,k), a conjecture was made to
classify deep holes in [5]. Since then a lot of effort has ... Keywords: Reed
Solomon code, deep hole, deep hole tree, Erdös Heilbronn conjecture. 1
Introduction ... 

 books.google.com ErdosHeilbronn conjecture The ErdosHeilbroon conjecture is another additive
theorem that has been successively fitted into the procedure described above.
Let us start by introducing some more terminology and notation. We say mset to
... 

 books.google.com This completes the proof of Snevily's conjecture for arbitrary cyclic groups of odd
order. ... we add up the elements of 2element subsets of A. The next conjecture
of Erdos and Heilbronn was proved in 1994 by Dias da Silva and Hamidoune. 

 books.google.com Andrew Granville, Melvyn Bernard Nathanson, Jozsef Solymosi   Preview A. Iosevich and M. Rudnev, Erdos distance problem in vector spaces over finite
fields, Trans. Amer. Math. Soc., to appear. 56. ... II: A generalization of the Erdos 
Heilbronn conjecture, Electron. J. Combin. 7 (2000), Research Paper 4 ... 

 books.google.com Conjecture. Melvyn B. Nathanson M.B. Nathanson () Department of Mathematics,
Lehman College (CUNY), Bronx, NY 10468, ... The lattice Z" is the Ballot
Numbers, Alternating Products, and the ErdősHeilbronn Conjecture 1
Introduction 2 ... 

 