A combinatorial approach to exponential patterns in multiplicative $IP^{\star}$ sets in $\mathbb{N}$
Combinatorics
2024-08-15 v3
Abstract
In [On sets and central sets, Combinatorica, 14 (1994) 269-277], N. Hindman and V.Bergelson proved additive -sets contain finite sums and finite products of a single sequence. An analogous study was made by A. Sisto in [Exponential triples, Electronics Journal of Combinatorics, 18 (2011), no. 147], where he proved that multiplicative -sets contain exponential of type and finite sums of a single sequence as well as exponential of type and finite products of another single sequence, using the algebra in the Stone-\v{C}ech Compactification of discrete semigroups. In this article, we will provide a combinatorial proof of the result of A. Sisto.
Keywords
Cite
@article{arxiv.2403.09585,
title = {A combinatorial approach to exponential patterns in multiplicative $IP^{\star}$ sets in $\mathbb{N}$},
author = {Pintu Debnath},
journal= {arXiv preprint arXiv:2403.09585},
year = {2024}
}
Comments
6 pages