Related papers: Inhomogeneous Partition Regularity

Suppose that $A$ is a $k \times d$ matrix of integers and write $\mathfrak{R}_A:\mathbb{N} \rightarrow \mathbb{N}\cup \{ \infty\}$ for the function taking $r$ to the largest $N$ such that there is an $r$-colouring $\mathcal{C}$ of $[N]$…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

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…

A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…

A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $X\subseteq G$ such that the set of its finite sums…

In recent work, Amdeberhan and Merca considered the integer partition function $a(n)$ which counts the number of integer partitions of weight $n$ wherein even parts come in only one color (i.e., they are monochromatic), while the odd parts…

We show that the pattern $\{x,x+y,xy\}$ is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive bounds. This provides a new proof for the partition…

A vertex coloring of a graph is called "perfect" if for any two colors $a$ and $b$, the number of the color-$b$ neighbors of a color-$a$ vertex $x$ does not depend on the choice of $x$, that is, depends only on $a$ and $b$ (the…

Let $\alpha,\beta,\gamma\in\mathbb{N}$. We prove that given an $r$-colouring of $\mathbb{F}_p$ with $p$ prime, there are more than $c_{r,\alpha,\beta,\gamma} p^2$ solutions to the equation $x^\alpha+y^\beta=z^\gamma$ with all of $x,y,z$ of…

In 1933, Rado conjectured that for any positive integer n, there is always a linear homogeneous equation with degree of regularity n. In proving this conjecture, Alexeev and Tsimerman, and independently Golowich, found that some equations…

In 1978, Richard Rado showed that every edge-coloured complete graph of countably infinite order can be partitioned into monochromatic paths of different colours. He asked whether this remains true for uncountable complete graphs and a…

We define a linear homogeneous equation to be strongly r-regular if, when a finite number of inequalities is added to the equation, the system of the equation and inequalities is still r-regular. In this paper, we show that, if a linear…

We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…

In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of…

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…

In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using theta function identities due to Ramanujan, we establish some new infinite…

W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B.…

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…