Combined exponential patterns in multiplicative IP sets
Abstract
IP sets play fundamental role in arithmetic Ramsey theory. A set is called an additive IP set if it is of the form FS( xnn∈ N)=\ Σt∈ Hxt:H. is a nonempty finite subset of .N\, whereas it is called a multiplicative IP set if it is of the form FP( xnn∈ N)=\ Πt∈ Hxt:H. is a nonempty finite subset of . N\ for some injective sequence xnn∈ N. An additive IP (resp. multiplicative IP) set is a set which intersects every additive IP set (resp. multiplicative IP set). In key-1, V. Bergelson and N. Hindman studied how rich additive IP sets are. They proved additive IP sets (AIP in short) contain finite sums and finite products of a single sequence. An analogous study was made by A. Sisto inkey-3, where he proved that multiplicative IP sets (MIP in short) contain exponential towerwill be defined later and finite product of a single sequence. However exponential patterns can be defined in two different ways. In this article we will prove that MIP sets contain two different exponential patterns and finite product of a single sequence. This immediately improves the result of A. Sisto. We also construct a MIP set, not arising from the recurrence of measurable dynamical systems. Throughout our work we will use the machinery of the algebra of the Stone-Cech Compactification of N.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.