Related papers: Further generalization of central sets theorem for…
A well-known result of W. Ray asserts that if $C$ is an unbounded convex subset of a Hilbert space, then there is a nonexpansive mapping $T$: $C\to C$ that has no fixed point. In this paper we establish some common fixed point properties…
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…
Using the Geometrization Theorem we prove a result on centralizers in fundamental groups of 3-manifolds. This result had been obtained by Jaco and Shalen and by Johannson using different techniques.
In this paper, we continue studying the properties of $\gamma^{*}$-semi-open sets in topological spaces introduced by S. Hussain, B. Ahmad and T. Noiri[8]. We also introduce and discuss the $\gamma^{*}$-semi-continuous functions which…
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
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…
A general approach to transference principles for discrete and continuous operator (semi)groups is described. This allows to recover the classical transference results of Calder\'on, Coifman and Weiss and of Berkson, Gillespie and Muhly and…
Glauberman's $Z^*$-theorem and analogous statements for odd primes show that, for any prime $p$ and any finite group $G$ with Sylow $p$-subgroup $S$, the centre of $G/O_{p^\prime}(G)$ is determined by the fusion system $\mathcal{F}_S(G)$.…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
The notion of density of a finite set is introduced. We prove a general theorem of set theory which refines the Gibbs, Bose--Einstein, and Pareto distributions as well as the Zipf law.
In the 1970s Deuber introduced the notion of $(m,p,c)$-sets in $\mathbb{N}$ and showed that these sets are partition regular and contain all linear partition regular configurations in $\mathbb{N}$. In this paper we obtain enhancements and…
In this article, we investigate the image and preimage of the important combinatorial sets such as central sets, $C$-sets, and $J_\delta$-sets which play an important role in the study of combinatorics under certain partial semigroup…
We introduce a general framework, based on \'etale topological categories, for studying discrete restriction semigroups and their algebras. Generalizing Paterson's universal groupoid of an inverse semigroup, we define the universal category…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
``What aspects of a group are unchanged, or stable, under homology equivalences''? The model theorem in this regard is the 1963 result of J. Stallings that the lower central series is preserved under any integral homological equivalence of…
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…
In the 1970s, structural Ramsey theory emerged as a new branch of combinatorics. This development came with the isolation of the concepts of the $\mathbf{A}$-Ramsey property and Ramsey class. Following the influential…
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large edge density and small diameter. In a series of papers Asratian and Khachatryan developed local criteria for the existence of Hamilton cycles…
A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…
In the topological dynamical system $(X,T)$, a point $x$ simultaneously approximates a point $y$ if there exists a sequence $n_1$, $n_2$, ... of natural numbers for which $T^{n_i} x$, $T^{2n_i}x$, ..., $T^{k n_i} x$ all tend to $y$. In…