相关论文: A Study Of Some Generalized Central Sets Theorem A…

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…

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…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

In \cite[Proposition 8.21 Page-169]{F} Using the methods of topological dynamics, H. Furstenberg introduced the notion of central set and proved the famous Central Sets Theorem. Later, in \cite{DHS}, D. De, H. Hindman and D. Struss…

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…

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…

A Central Limit Theorem for non-commutative random variables is proved using the Lindeberg method. The theorem is a generalization of the Central Limit Theorem for free random variables proved by Voiculescu. The Central Limit Theorem in…

We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…

Sets satisfying Central sets theorem and other Ramsey theoretic large sets were studied extensively in literature. Hindman and Strauss proved that product of some of these large sets is again large. In this paper we show that if we take two…

We present a short proof of the central limit theorem which is elementary in the sense that no knowledge of characteristic functions, linear operators, or other advanced results are needed. Our proof is based on Lindeberg's trick of…

The notion of Image partition regularity near zero was first introduced by De and Hindman. It was shown there that like image partition regularity over $\mathbb{N}$ the main source of infinite image partition regular matrices near zero are…

In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.

``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 prove a central limit theorem for smooth linear statistics associated with zero divisors of standard Gaussian holomorphic sections in a sequence of holomorphic line bundles with Hermitian metrics of class $\mathscr{C}^{3}$ over a compact…

We present a general approach to establish the Central Limit Theorem with error bounds for sequential dynamical systems. The main tool we develop is the application to this setting of a projective metric on complex cones, following the…

In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…

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)…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

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.

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…