Related papers: Monochromatic sums and quotients in $\mathbb N$
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…
Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…
Suppose that $\mathbb{F}_p$ is coloured with $r$ colours. Then there is some colour class containing at least $c_r p^2$ quadruples of the form $(x, y , x + y, xy)$.
Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…
Recently, S.~Kanti Patra and Md.~Moid Shaik proved the existence of monochromatic solutions to systems of polynomial equations near zero for particular dense subsemigroups $S$ of $((0,\infty),+)$. We extend their results to a much larger…
We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…
We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…
We prove that for any coloring of the naturals using two colors there are monochromatic sets of the form $\{x,y,xy,x+iy:i\leq k\}$ and $\{x,y,x^y,xy^i:i\leq k\}$ for any $k$.
In this article, we will explore a recent method of Alweiss \cite{key-1} using ultrafilter technique to study monochromatic partition regular structure of the form $\left\{ x,y,x+y,x\cdot y\right\} $ over rationals, which is recently proved…
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…
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…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.
W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…
Answering a conjecture of A. Sisto, J. Sahasrabudhe proved the exponential version of the Schur theorem: for every finite coloring of the naturals, there exists a monochromatic copy of $\{x,y,x^y:x\neq y\},$ which initiates the study of…
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…
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 study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…
We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…
Consider an arbitrary coloring of integers with finite number of colors. Is it true that there are x, y such that x + y, xy and x have the same color? This is a well-known question of Ramsey theory has not solved yet. In the article we give…