Search arXivSearch

arXiv · 2501.17203

Homogeneous Patterns in Ramsey Theory

Abstract

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an infinite set $A$ and an arbitrarily large finite set $B$ such that $A \cup (A+B) \cup A \cdot B$ is monochromatic. This result resolves the finitary version of a question posed by Kra, Moreira, Richter, and Robertson regarding the partition regularity of $(A+B) \cup A \cdot B$ for infinite sets $A, B$ (see (Question 8.4, J. Amer. Math. Soc., 37 (2024))), which is closely related to a question of Erdős. As the second application, we make progress on a nonlinear extension of the partition regularity of Pythagorean triples. Specifically, we demonstrate that the equation $x^2 + y^2 = z^2 + P(u_1, \dots, u_n)$ is $2$-regular for certain appropriately chosen polynomials $P$ of any desired degree. Finally, as the third application, we establish a nonlinear variant of Rado's conjecture concerning the degree of regularity. We prove that for every $m, n \in \mathbb{Z}^+$, there exists an $m$-degree homogeneous equation that is $n$-regular but not $(n+1)$-regular. The case $m = 1$ corresponds to Rado's conjecture, originally proven by Alexeev and Tsimerman (J. Combin. Theory Ser. A, 117 (2010), and later independently by Golowich (Electron. J. Combin. 21 (2014)).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sukumar Das Adhikari, Sayan Goswami. 2025-04-15. Homogeneous Patterns in Ramsey Theory. https://arxiv.org/abs/2501.17203

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO