Partition regularity of nonlinear polynomials: a nonstandard approach

zbMATH Open1297.05234arXiv1301.1467MaRDI QIDQ5495445FDOQ5495445

Authors: Lorenzo Luperi Baglini 

Publication date: 4 August 2014

Abstract: In 2011, Neil Hindman proved that for every natural number $n,m$ the polynomial �egin{equation*} sum_{i=1}^{n} x_{i}-prodlimits_{j=1}^{m} y_{j} end{equation*} has monochromatic solutions for every finite coloration of $mathbbN$. We want to generalize this result to two classes of nonlinear polynomials. The first class consists of polynomials $P(x_1,\mathrm{...},x_n,y_1,\mathrm{...},y_m)$ of the following kind: �egin{equation*} P(x_{1},...,x_{n},y_{1},...,y_{m})=sum_{i=1}^{n}a_{i}x_{i}M_{i}(y_{1},...,y_{m}), end{equation*} where $n,m$ are natural numbers, $sumlimit{s}_{i=1}^n{a}_i{x}_i$ has monochromatic solutions for every finite coloration of $mathbbN$ and the degree of each variable $y_1,\mathrm{...},y_m$ in $M_i(y_1,\mathrm{...},y_m)$ is at most one. An example of such a polynomial is �egin{equation*} x_{1}y_{1}+x_{2}y_{1}y_{2}-x_{3}.end{equation*} The second class of polynomials generalizing Hindman's result is more complicated to describe; its particularity is that the degree of some of the involved variables can be greater than one.\ The technique that we use relies on an approach to ultrafilters based on Nonstandard Analysis. Perhaps, the most interesting aspect of this technique is that, by carefully chosing the appropriate nonstandard setting, the proof of the main results can be obtained by very simple algebraic considerations.

Full work available at URL: https://arxiv.org/abs/1301.1467

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A nonstandard technique in combinatorial number theory
• Partition regularity of nonlinear polynomials: a nonstandard approach
• Partition regularity of polynomial systems near zero
• Infinite monochromatic patterns in the integers
• Monochromatic sums and products in \(\mathbb{N}\)

zbMATH Keywords

ultrafilternonstandard analysispartition regularitymonochromatic solutionfinite colorationnonlinear polynomial

Mathematics Subject Classification ID

Ramsey theory (05D10) Nonstandard models in mathematics (03H05) Nonstandard arithmetic and field theory (12L15)

Cited In (10)

• Nonstandard characterisations of tensor products and monads in the theory of ultrafilters
• Infinite monochromatic patterns in the integers
• Ramsey properties of nonlinear Diophantine equations
• A nonstandard technique in combinatorial number theory
• Dynamical notions along filters
• Partition regularity of polynomial systems near zero
• Foundations of iterated star maps and their use in combinatorics
• On Rado conditions for nonlinear Diophantine equations
• Rado equations solved by linear combinations of idempotent ultrafilters
• \(\mathcal {F}\)-finite embeddabilities of sets and ultrafilters

This page was built for publication: Partition regularity of nonlinear polynomials: a nonstandard approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495445)