Abstract
We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials; in particular, we obtain extensions of both the additive and multiplicative versions of Hindman's theorem. These configurations are obtained by means of suitable symmetric polynomials that mix the two operations. The simplest example is the following. For every finite coloring N=C1∪…∪Cr there exists an infinite increasing sequence a<b<c<… such that all elements below are monochromatic:a,b,c,…,a+b+ab,a+c+ac,b+c+bc,…,a+b+c+ab+ac+bc+abc,…. The proofs use tools from algebra in the space of ultrafilters βZ.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have