Related papers: A combinatorial approach to the stronger Central S…
In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subset of the given semigroup to countably many. In this paper,…
In this paper, a decomposition theorem for (covariant) unitary group representations on Kaplansky-Hilbert modules over Stone algebras is established, which generalizes the well-known Hilbert space case (where it coincides with the…
In a recent work, N. Hindman, D. Strauss and L. Zamboni have shown that the Hales-Jewett theorem can be combined with a sufficiently well behaved homomorphisms. Their work was completely algebraic in nature, where they have used the algebra…
There are several notions of largeness in a semigroup. N. Hindman and D. Strauss established that if $u,v \in \mathbb{N}$, $A$ is a $u \times v$ matrix with entries from $\mathbb{Q}$ and $\psi$ is a notion of a large set in $\mathbb{N}$,…
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…
There is a long history of studying Ramsey theory using the algebraic structure of Stone-Cech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic large…
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…
In 1970 R. Schmidt gave a structural classification for CA-groups. In this paper we consider a condition upon the intersection of element centralisers which turns out to be equivalent to the definition of a CA-group. We then weaken which…
Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…
This article presents an in-depth educational overview of the latest mathematical developments in coupled cluster (CC) theory, beginning with Schneider's seminal work from 2009 that introduced the first local analysis of CC theory. We offer…
The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…
Hegyv\'ari and Hennecart showed that if $B$ is a sufficiently large brick of a Heisenberg group, then the product set $B\cdot B$ contains many cosets of the center of the group. We give a new, robust proof of this theorem that extends to…
We obtain algebraic characterizations of relative notions of size in a discrete semigroup that generalize the usual combinatorial notions of syndetic, thick, and piecewise syndetic sets. "Filtered" syndetic and piecewise syndetic sets were…
The famous Cantor-Bernstein-Schroder theorem (CBS-theorem for short) of set theory was generalized by Sikorski and Tarski to \sigma-complete Boolean algebras. After this, numerous generalizations of the CBS-theorem, extending the…
Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…
Central configurations have been of great interest over many years, with the earliest examples due to Euler and Lagrange. There are numerous results in the literature demonstrating the existence of central configurations with specific…
Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…
Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been developed in many…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…