Exponential Schur and Hindman Theorem in Ramsey Theory
Sayan Goswami, Sourav Kanti Patra

TL;DR
This paper advances exponential Ramsey theory by providing new proofs of exponential Schur and Hindman theorems, establishing partition regularity of exponential equations, and exploring ultrafilter properties related to these results.
Contribution
It introduces novel proofs of exponential Schur and Hindman theorems, and proves the partition regularity of exponential equations, extending classical results to the exponential setting.
Findings
Provided two short proofs of the exponential Schur theorem.
Proved the exponential Hindman theorem using polynomial van der Waerden theorem.
Established the partition regularity of specific exponential equations.
Abstract
Answering a conjecture of A. Sisto, J. Sahasrabudhe proved the exponential version of the Schur theorem: for every finite coloring of the naturals, there exists a monochromatic copy of which initiates the study of exponential Ramsey theory in arithmetic combinatorics. In this article, We first give two short proofs of the exponential Schur theorem, one using Zorn's lemma and another using van der Waerden's theorem. Then using the polynomial van der Waerden theorem iteratively we give a proof of the exponential Hindman theorem. Then applying our results we prove for every natural number the equation is partition regular, which can be considered as the exponential version of a more general version of the P. Csikv\'{a}ri, K. Gyarmati, and A. S\'{a}rk\"{o}zy conjecture, which was solved by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Advanced Graph Theory Research
