Related papers: A Multidimensional Central Sets Theorem

In [B] Beiglb\"ock gave a Multidimension Central sets theorem. Recently, [GP] extended this result for polynomials. They proved the Multidimensional Polynomial Central sets theorem. Earlier, Hindman and Leader introduced the near zero…

A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…

We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…

In this paper, we introduce notions of $J$-set near zero and $C$-set near zero for a dense subsemigroup of $((0,+\infty),+)$ and obtain some results for them. Also we derive the Central Sets Theorem near zero.

In [F81] Furstenberg introduced the notion of central set and established his famous Central Sets Theorem. Since then, several improved versions of Furstenberg's result have been found. The strongest generalization has been published by De,…

Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

Furstenberg introduced the notion of Central sets in 1981. Later in 1990 V. Bergelson and N. Hindman proved a different but an equivalent version of the central set theorem. In 2008 D. De, N. Hindman and D. Strauss proved a stronger version…

The arising of central extensions is discussed in two contexts. At first classical counterparts of quantum anomalies (deserving being named as "classical anomalies") are associated with a peculiar subclass of the non-equivariant maps.…

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

As we known, the {\it Seifert-Van Kampen theorem} handles fundamental groups of those topological spaces $X=U\cup V$ for open subsets $U, V\subset X$ such that $U\cap V$ is arcwise connected. In this paper, this theorem is generalized to…

We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we…

We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…

Hindman and Leader first introduced the notion of Central sets near zero for dense subsemigroups of $((0,\infty),+)$ and proved a powerful combinatorial theorem about such sets. Using the algebraic structure of the Stone-$\breve{C}$ech…

Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this…

Van der Waerden's theorem, published in Nieuw. Arch. Wisk. 15 (1927), acted as a catalyst for major further developments in Ramsey theory. In this survey, we delve into the legacy of this mathematical gem, tracing its historical origin,…

In \cite[Proposition 8.21 Page-169]{F} Using the methods of topological dynamics, H. Furstenberg introduced the notion of central set and proved the famous Central Sets Theorem. Later, in \cite{DHS}, D. De, H. Hindman and D. Struss…

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…