English

Monochromatic Solutions to Systems of Exponential Equations

Combinatorics 2016-08-02 v1

Abstract

Let nNn\in \mathbb{N}, RR be a binary relation on [n][n], and C1(i,j),,Cn(i,j)ZC_1(i,j),\ldots,C_n(i,j) \in \mathbb{Z}, for i,j[n]i,j \in [n]. We define the exponential system of equations E(R,(Ck(i,j)i,j,k)\mathcal{E}(R,(C_k(i,j)_{i,j,k}) to be the system XiY1C1(i,j)YnCn(i,j)=Xj, for (i,j)R, X_i^{Y_1^{C_1(i,j)} \cdots Y_n^{C_n(i,j)} } = X_j , \text{ for } (i,j) \in R , in variables X1,,Xn,Y1,,YnX_1,\ldots,X_n,Y_1,\ldots,Y_n. The aim of this paper is to classify precisely which of these systems admit a monochromatic solution (Xi,Yi1)X_i,Y_i \not=1) in an arbitrary finite colouring of the natural numbers. This result could be viewed as an analogue of Rado's theorem for exponential patterns.

Keywords

Cite

@article{arxiv.1608.00109,
  title  = {Monochromatic Solutions to Systems of Exponential Equations},
  author = {Julian Sahasrabudhe},
  journal= {arXiv preprint arXiv:1608.00109},
  year   = {2016}
}
R2 v1 2026-06-22T15:08:19.419Z