A combinatorial approach to the stronger Central Sets Theorem for semigroups
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910010557071360 |
|---|---|
| author | Debnath, Pintu |
| author_facet | Debnath, Pintu |
| contents | H. Furstenberg introduced the notion of central sets in terms of topological dynamics and established the famous Central Sets Theorem. Later in [A new and stronger Central Sets Theorem, Fund. Math. 199 (2008), 155-175], D. De, N. Hindman, and D. Strauss established a stronger version of the Central Sets Theorem that uses the algebra of the Stone-\v Cech compactification of discrete semigroups. In this article, We will provide a new and combinatorial proof of the stronger Central Sets Theorem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_03736 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A combinatorial approach to the stronger Central Sets Theorem for semigroups Debnath, Pintu Combinatorics 22A15, 54D35, 05D10 H. Furstenberg introduced the notion of central sets in terms of topological dynamics and established the famous Central Sets Theorem. Later in [A new and stronger Central Sets Theorem, Fund. Math. 199 (2008), 155-175], D. De, N. Hindman, and D. Strauss established a stronger version of the Central Sets Theorem that uses the algebra of the Stone-\v Cech compactification of discrete semigroups. In this article, We will provide a new and combinatorial proof of the stronger Central Sets Theorem. |
| title | A combinatorial approach to the stronger Central Sets Theorem for semigroups |
| topic | Combinatorics 22A15, 54D35, 05D10 |
| url | https://arxiv.org/abs/2602.03736 |