Search arXivSearch

arXiv · 2506.23865

Further generalization of central sets theorem for partial semigroups and vip systems

Abstract

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 the algebraic structure of the Stone-$Č$ech compactification $β$ S of a semigroup S, N. Hindman and V. Bergelson extended the theorem in 1990. H. Shi and H. Yang established a topological dynamical characterization of central sets in an arbitrary semigroup (S,+), and showed it to be equivalent to the usual algebraic characterization. D. De, N. Hindman, and D. Strauss later proved a stronger version of the Central Sets Theorem for semigroups in 2008. D. Phulara further genaralized the result for commutative semigroups in 2015. Recently in his work, Zhang generalized it further and proved the central sets theorem for uncountably many central sets. We extend the theorem to arbitrary adequate partial semigroups and VIP systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anik Pramanick, MD Mursalim Saikh. 2025-06-30. Further generalization of central sets theorem for partial semigroups and vip systems. https://arxiv.org/abs/2506.23865

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO