Related papers: A combinatorial approach to central to theorem

In this paper, we introduce new methods for solving the vacuum Einstein constraints equations: the first one is based on Schaefer's fixed point theorem (known methods use Schauder's fixed point theorem) while the second one uses the concept…

This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…

We systematize and analyze some results obtained in Subset Combinatorics of $G$ groups after publications the previous surveys [1-4]. The main topics: the dynamical and descriptive characterizations of subsets of a group relatively their…

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 article, we use the Combinatorial Nullstellensatz to give new proofs of the Cauchy-Davenport, the Dias da Silva-Hamidoune and to generalize a previous addition theorem of the author. Precisely, this last result proves that for a set…

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…

The main goal of this paper is to develop a new embedding method which we use to show that some finite metric spaces admit low-distortion embeddings into all non-superreflexive spaces. This method is based on the theory of…

Concentration compactness method is a powerful techniques for establishing existence of minimizers for inequalities and of critical points of functionals in general. The paper gives a functional-analytic formulation for the method in Banach…

We establish a central limit theorem and prove a moderate deviation principle for stochastic scalar conservation laws. Due to the lack of viscous term, this is done in the framework of kinetic solution. The weak convergence method and…

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…

In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…

Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…

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…

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

We generalize the concept of combinatorial nested set complexes to posets and exhibit the topological relationship between the arising nested set complexes and the order complex of the underlying poset. In particular, a sufficient condition…

We characterize relative notions of syndetic and thick sets using, what we call, "derived" sets along ultrafilters. Manipulations of derived sets is a characteristic feature of algebra in the Stone-\v{C}ech compactification and its…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

Kakutani's fixed point theorem is a generalization of Brouwer's fixed point theorem to upper semicontinuous multivalued maps and is used extensively in game theory and other areas of economics. Earlier works have shown that Sperner's lemma…

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…