A combinatorial approach to exponential patterns in multiplicative IP sets in N

Abstract

In [On IPsets and central sets, Combinatorica, 14 (1994) 269-277], N. Hindman and V.Bergelson proved additive IP-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 IP-sets contain exponential IP of type I and finite sums of a single sequence as well as exponential IP of type II and finite products of another single sequence, using the algebra in the Stone-Cech Compactification of discrete semigroups. In this article, we will provide a combinatorial proof of the result of A. Sisto.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…