Abstract
Let n∈N, R be a binary relation on [n], and C1(i,j),…,Cn(i,j)∈Z, for i,j∈[n]. We define the exponential system of equations E(R,(Ck(i,j)i,j,k) to be the systemXiY1C1(i,j)⋯YnCn(i,j)=Xj, for (i,j)∈R, in variables X1,…,Xn,Y1,…,Yn. The aim of this paper is to classify precisely which of these systems admit a monochromatic solution (Xi,Yi≠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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.