2000 character limit reached
Towards characterizing the 2-Ramsey equations of the form $ax+by=p(z)$ (2209.09334v1)
Published 19 Sep 2022 in math.CO and math.NT
Abstract: In this paper, we study a Ramsey-type problem for equations of the form $ax+by=p(z)$. We show that if certain technical assumptions hold, then any 2-colouring of the positive integers admits infinitely many monochromatic solutions to the equation $ax+by=p(z)$. This entails the $2$-Ramseyness of several notable cases such as the equation $ax+y=zn$ for arbitrary $a\in\mathbb{Z}{+}$ and $n\ge 2$, and also of $ax+by=a_DzD+\dots+a_1z\in\mathbb{Z}[z]$ such that $\text{gcd}(a,b)=1$, $D\ge 2$, $a,b,a_D>0$ and $a_1\neq0$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.