Related papers: Partition Regularity of Nonlinear Polynomials: a N…
In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…
Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…
We show that for every coloring of the rationals into finitely many colors, one of the colors contains a set of the form $\{x,y,xy,x+y\}$ for some nonzero $x$ and $y$.
In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in…
We show that for any finite partition of $\mathbb{N}$ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily…
We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…
Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…
This article resolves two related problems in Ramsey theory on the integers. We show that for any finite coloring of the set of natural numbers, there exist numbers $a$ and $b$ for which the configuration $\{a, b, ab, a(b+1)\}$ is…
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…
An infinite integer matrix A is called image partition regular if, whenever the natural numbers are finitely coloured, there is an integer vector x such that Ax is monochromatic. Given an image partition regular matrix A, can we also insist…
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman's Theorem. This paper introduces Ramsey algebras and…
We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…
Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…
The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…
Let $k,a\in \mathbb{N}$ and let $p_1,\cdots,p_k\in \mathbb{Q}[n]$ with zero constant term. We show that for any finite coloring of $\mathbb{Q}$, there are non-zero $x,y\in \mathbb{Q}$ such that there exists a color which contains a set of…
We study the number of monochromatic solution to linear equation in $\{1,\dots,n\}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
In this paper we prove that for any finite coloring of N there are lambda,rho in N such that infinitely many pairs (x,y),(u,v) in N^2 satisfy the sets {lambda x, lambda y, x y, lambda(x+y)} and {u+rho, v+rho, u v+rho, u+v} being…