English
Related papers

Related papers: Dynamics Near An Idempotent

200 papers

The notion of almost centralizer and almost commutator are introduced and basic properties are established. They are used to study $\widetilde{\mathfrak M}\_c$-groups, i. e.groups for which every descending chain of centralizers each having…

Logic · Mathematics 2015-10-01 Nadja Hempel

Using the methods from topological dynamics, H. Furstenberg introduced the notion of a central set and proved the famous Central Sets Theorem. Later D. De, Neil Hindman, and D. Strauss [Fund. Math.199 (2008), 155-175.] established a…

Dynamical Systems · Mathematics 2024-10-25 Pintu Debnath , Sayan Goswami

Furstenberg, using tools from topological dynamics, defined the notion of a central subset of positive integers, and proved a powerful combinatorial theorem about such sets. Using the algebraic structure of the Stone-\v{C}ech…

Dynamical Systems · Mathematics 2011-12-06 John H. Johnson

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…

Combinatorics · Mathematics 2014-09-23 Tanushree Biswas

We characterize relative notions of syndetic and thick sets using, what we call, "derived" sets along ultrafilters. Manipulations of derived sets is a characteristic feature of algebra in the Stone-\v{C}ech compactification and its…

General Topology · Mathematics 2025-12-16 Shea D. Burns , Dennis Davenport , Shakuan Frankson , Conner Griffin , John H. Johnson , Malick Kebe

In this paper we establish a new connection between central sets and the strong coincidence conjecture for fixed points of irreducible primitive substitutions of Pisot type. Central sets, first introduced by Furstenberg using notions from…

Combinatorics · Mathematics 2013-01-25 Marcy Barge , Luca Q. Zamboni

The study of the size of subsets in a semigroup have shown that many of these subsets have strong combinatorial properties and contribute richly to the algebraic structure of the Stone-Cech compactification of a discrete semigroup. N.…

Combinatorics · Mathematics 2025-12-03 Kilangbenla Imsong , Ram Krishna Paul

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…

Combinatorics · Mathematics 2025-06-18 Mauro Di Nasso

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…

Combinatorics · Mathematics 2018-10-19 Arpita Ghosh

We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem.

Logic · Mathematics 2009-09-25 Andreas Blass

The Central Sets Theorem was introduced by H. Furstenberg and then afterwards several mathematicians have provided various versions and extensions of this theorem. All of these theorems deal with central sets, and its origin from the…

Combinatorics · Mathematics 2021-10-13 Sayan Goswami , Jyotirmoy Poddar

A classical result of topological algebra states that any compact left topological semigroup has an idempotent. We refine this by showing that any compact left topological left semiring has a common, i.e. additive and multiplicative…

General Topology · Mathematics 2010-02-09 Denis I. Saveliev

H. Furstenberg defined Central sets in $\mathbb{N}$ by using the notions of topological dynamics, later Bergelson and Hindman characterized central sets in $\mathbb{N}$ and also in arbitrary semigroup in terms of algebra of Stone-\v{C}ech…

Combinatorics · Mathematics 2024-06-10 H. Goodarzi , M. A. Tootkaboni , Arpita Ghosh

The concept of Central sets, introduced by Furstenberg through the framework of topological dynamics, has played a pivotal role in combinatorial number theory. Furstenberg's Central Sets Theorem highlighted their rich combinatorial…

Combinatorics · Mathematics 2025-06-03 Pintu Debnath , Sayan Goswami , Chunlin Liu

In this paper subcentral (resp., central) idempotent series and composition subcentral (resp., central) idempotent series in an inverse semigroup are introduced and investigated. It is shown that if $S=EG$ is a factorizable inverse monoids…

Group Theory · Mathematics 2024-12-30 Dong-lin Lei , Jin-xing Zhao , Xian-zhong Zhao

We describe the primitive central idempotents of the group algebra over a number field of finite monomial groups. We give also a description of the Wedderburn decomposition of the group algebra over a number field for finite strongly…

Representation Theory · Mathematics 2014-11-24 Gabriela Olteanu , Inneke Van Gelder

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

Group Theory · Mathematics 2019-06-12 Benjamin Blanchette , Christian Choffrut , Christophe Reutenauer

Using the methods of topological dynamics, H. Furstenberg introduced the notion of a central set and proved the famous Central Sets Theorem. D. De, N. Hindman, and D. Strauss introduced $C$-set, satisfying the strong central set theorem.…

Combinatorics · Mathematics 2024-10-22 Pintu Debnath

We characterize when the finite Cartesian product of central sets near idempotent is central near idempotent. Moreover, we provide a partial characterization for the infinite Cartesian product of the same. Then, we study the abundance of…

Combinatorics · Mathematics 2024-04-11 Surajit Biswas , Sourav Kanti Patra , Sabyasachi Dey