Related papers: A Generalized Central Sets Theorem In Partial Semi…

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

We provide short and direct proofs for some classical theorems proved by Howie, Levi and McFadden concerning idempotent generated semigroups of transformations on a finite set.

Motivated by generalizing Szemer\'edi's theorem, we the elements in a discrete quantum group fixing a sequence of finite subsets and prove that the set of these elements is a quantum subgroup. Using this we obtain a version of mean ergodic…

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called (1) $\mathcal C$-$closed$ if $X$ is closed in every topological semigroup $Y\in\mathcal C$ containing $X$ as a discrete subsemigroup, (2) $ideally$ $\mathcal…

Hindman and Leader first introduced the notion of semigroup of ultrafilters converging to zero for a dense subsemigroups of $((0,\infty),+)$. Using the algebraic structure of the Stone-$\breve{C}$ech compactification, Tootkabani and Vahed…

Lee and Kwon [12] defined an ordered semigroup S to be completely regular if a 2 (a2Sa2] for every a 2 S. We characterize every completely regular ordered semigroup as a union of t-simple subsemigroups, and every Clifford ordered semigroup…

A non-classical formulation of the central limit theorem is given for sequences of independent random variables with finite second moments. Singular sequences whose members all have a degenerate or normal distribution are excluded from…

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…

The notion of central stability was first formulated for sequences of representations of the symmetric groups by Putman. A categorical reformulation was subsequently given by Church, Ellenberg, Farb, and Nagpal using the notion of…

We establish the first common fixed point theorem for commutative set-valued mappings. This may help to generalize common fixed point theorems in single-valued setting to those in set-valued. We also prove the existence of a fixed point in…

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…

We prove that the central sequence algebra of a separable C*-algebra is either subhomogeneous or non-exact, confirming a conjecture of Enders and Shulman. We also prove analogous dichotomy for other massive C*-algebras.

We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…

The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…

We prove the central limit theorem (CLT) for a sequence of independent zero-mean random variables $\xi_j$, perturbed by predictable multiplicative factors $\lambda_j$ with values in intervals $[\underline\lambda_j,\overline\lambda_j]$. It…

In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…

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…

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…

Let $\alpha>0$ and $0<\gamma<1$. Define $g_{\alpha,\gamma}:\mathbb{N}\rightarrow\mathbb{N}$ by $g_{\alpha,\gamma}\left(n\right)=\lfloor\alpha n+\gamma\rfloor$. The set $\left\{ g_{\alpha,\gamma}\left(n\right):n\in\mathbb{N}\right\} $ is…

We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…