Exponential Patterns in Arithmetic Ramsey Theory
Preprint
Abstract
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation. For example, as a corollary to our main theorem, we show that for every $n \in \mathbb{N}$ and for every finite colouring of the natural numbers, we may find a monochromatic set including the integers $x_1,\ldots,x_n >1$; all products of distinct $x_i$; and all "exponential compositions" of distinct $x_i$ which respect the order $x_1,\ldots,x_n$. In particular, for every finite colouring of the natural numbers one can find a monochromatic quadruple of the form $\{ a,b,ab,a^b \}$, where $a,b>1$.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Partition regularity without the columns propertyProceedings of the American Mathematical Society, 2015
- Density and ramsey type results on algebraic equations with restricted solution setsCombinatorica, 2012
- Open Problems in Partition RegularityCombinatorics, Probability and Computing, 2003
- Infinite partition regular matrices: solutions in central setsTransactions of the American Mathematical Society, 2002
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett TheoremJournal of the London Mathematical Society, 2000
- Image Partition Regularity of MatricesCombinatorics, Probability and Computing, 1993
- A canonical partition relation for finite subsets of ωJournal of Combinatorial Theory, Series A, 1976
- Ramsey's theorem with sums or unionsJournal of Combinatorial Theory, Series A, 1975
- Finite sums from sequences within cells of a partition of NJournal of Combinatorial Theory, Series A, 1974
- Studien zur KombinatorikMathematische Zeitschrift, 1933