A zero-sum theorem
For a nontrivial abelian group \(G\) of order \(m\), \(G\)-colorings of the integer set \([1,n]:=\{1,2,\ldots,n\}\) associating one element of \(G\) with every element of \([1,n]\) are considered. An \(m\)-tuple \((x_1,\dots,x_m)\) of integers from \([1,n]\) is called zero-sum with respect to a given coloring if the sum of the images of these integers in \(G\) is zero. It is shown that \(n=m(m-1)+1\) is the smallest integer such that every \(G\)-coloring of \([1,n]\) contains a zero-sum solution to the inequality \(x_1+x_2+\cdots+x_{m-1}<x_m\). For cyclic abelian groups \(G\) this yields an Erdős-Ginzburg-Ziv type generalization of a known result concerning a monochromatic solution of the above inequality in a 2-coloring of the positive integers.
- scientific article; zbMATH DE number 524118 (Why is no real title available?)
- scientific article; zbMATH DE number 887757 (Why is no real title available?)
- scientific article; zbMATH DE number 3102822 (Why is no real title available?)
- On a variation of Schur numbers
- On a zero-sum generalization of a variation of Schur's equation
- Zero-sum problems -- a survey
- On a zero-sum generalization of a variation of Schur's equation
- On the degree of regularity of a certain quadratic Diophantine equation
- The two-colour Rado number for the equation \(ax+by=(a+b)_z\)
- On Rado numbers for \(\Sigma^{m-1}_{i=1} a_{i}x_{i}= x_{m}\)
- An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
- Disjunctive Rado numbers
- A conjecture concerning zero-sum problem
- A Two-Set Problem on Coloring the Integers
- scientific article; zbMATH DE number 7731181 (Why is no real title available?)
- A five color zero-sum generalization
This page was built for publication: A zero-sum theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865416)
