Combined exponential patterns in multiplicative $IP^{\star}$ sets
Abstract
sets play fundamental role in arithmetic Ramsey theory. A set is called an additive set if it is of the form is a nonempty finite subset of , whereas it is called a multiplicative set if it is of the form is a nonempty finite subset of for some injective sequence An additive (resp. multiplicative ) set is a set which intersects every additive set (resp. multiplicative set). In \cite{key-1}, V. Bergelson and N. Hindman studied how rich additive sets are. They proved additive sets ( in short) contain finite sums and finite products of a single sequence. An analogous study was made by A. Sisto in\cite{key-3}, where he proved that multiplicative sets ( in short) contain exponential tower\footnote{will 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 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 set, not arising from the recurrence of measurable dynamical systems. Throughout our work we will use the machinery of the algebra of the Stone-\v{C}ech Compactification of .
Cite
@article{arxiv.2310.18873,
title = {Combined exponential patterns in multiplicative $IP^{\star}$ sets},
author = {Pintu Debnath and Sayan Goswami},
journal= {arXiv preprint arXiv:2310.18873},
year = {2023}
}