Related papers: Multidimensional central sets theorem near zero
N. Hindman and I. Leader introduced the set of ultrafilters 0+ on (0,1) and characterize smallest ideal of (0+,+) and proved the Central Set Theorem near zero. Recently Polynomial Central Set Theorem has been proved by V. Bergelson, J. H.…
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…
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.
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…
The Central sets theorem was first introduced by H. Furstenberg [F] in terms of Dynamical systems. Later Hindman and Bergelson extended the theorem using Stone-$\v{C}$ech compactification $\beta$$\mathbb{N}$ of $\mathbb{N}$. In [SY]…
The Central Sets Theorem near zero was originally proved by Hindman and Leader. Later a version of Central Sets Theorem was proved by De, Hindman and Strauss known to be the stronger Central Sets Theorem. Subsequently many other versions of…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
In this paper a generalized topological central point theorem is proved for maps of a simplex to finite-dimensional metric spaces. Similar generalizations of the Tverberg theorem are considered.
We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions arising from the direct proof of the Central Limit Theorem…
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
Hindman's theorem and van der Waerden's theorem are two classical Ramsey theoretic results, the first one deals with finite configurations and the second one deals with infinite configurations. The Central Sets Theorem due to Furstenberg is…
We establish and fully characterize the multidimensional extension of the Stronger Central Sets Theorem. Additionally, we develop a polynomial generalization of this result. Our approach utilizes tools from the Algebra of the Stone-\v{C}ech…
The Theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a…
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,…
Combinatorially Rich sets were introduced by Bergelson and Glasscock for commutative semigroup. Latter Hindman, Hosseini, Strauss and Tootkaboni extended the definition of Combinatorially Rich sets for arbitrary semigroup. Recently Goswami…
Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…
The Central Sets Theorem, a fundamental result in Ramsey theory, is a joint extension of both Hindman's theorem and van der Waerden's theorem. It was originally introduced by H. Furstenberg using methods from topological dynamics. Later,…
Using dynamics, Furstenberg defined the concept of a central subset of positive integers and proved several powerful combinatorial properties of central sets. Later using the algebraic structure of the Stone-\v{C}ech compactification,…
Tootkaboni and Vahed introduced the notion of some large sets near idempotent along with some combinatorial properties. We characterize when the finite Cartesian product of central sets near idempotent is central near idempotent. Moreover,…
Peng (2006) initiated a new kind of central limit theorem under sub-linear expectations. Song (2017) gave an estimate of the rate of convergence of Peng's central limit theorem. Based on these results, we establish a new kind of almost sure…