Related papers: A combinatorial approach to central to theorem
Condensed mathematics, developed by Clausen and Scholze over the last few years, is a new way of studying the interplay between algebra and geometry. It replaces the concept of a topological space by a more sophisticated but better-behaved…
In this paper, we introduce notions of $J$-set near zero and $C$-set near zero for a dense subsemigroup of $((0,+\infty),+)$ and obtain some results for them. Also we derive the Central Sets Theorem near zero.
Recent advances in center-based clustering continue to improve upon the drawbacks of Lloyd's celebrated $k$-means algorithm over $60$ years after its introduction. Various methods seek to address poor local minima, sensitivity to outliers,…
This paper establishes a combinatorial central limit theorem for stratified randomization, which holds under a Lindeberg-type condition. The theorem allows for an arbitrary number or sizes of strata, with the sole requirement being that…
Characterizations of ultrafilters belong to the smallest ideal of Stone-\v{C}ech compactification of a discrete semigroup are exhibited using syndetic sets, strongly central sets and very strongly central sets respectively. These lead to…
A variant of the Circle Packing Theorem states that the combinatorial class of any convex polyhedron contains elements midscribed to the unit sphere centered at the origin, and that these representatives are unique up to M\"obius…
Studies on ensemble methods for classification suffer from the difficulty of modeling the complementary strengths of the components. Kleinberg's theory of stochastic discrimination (SD) addresses this rigorously via mathematical notions of…
With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering…
We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geometric manifestations of the same topological phenomena. In…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…
There are several compactification procedures in topology, but there is only one standard discretization, namely, replacing the original topology with the discrete topology. We give a notion of discretization which is dual (in categorical…
Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. Let U be a cluster algebra of type A_n. We associate to each cluster C of U an abelian category Cat_C such that the indecomposable…
In this paper we revisit two concepts which were originally introduced by Aschbacher and are crucial in the theory of saturated fusion systems: Firstly, we give a new approach to defining the centralizer of a normal subsystem. Secondly, we…
We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey…
We introduce the notion of a hyper-atom and prove a basic property of this object. This new method allows to improve several results in the classical critical pair theory including its cornerstone: the Kemperman Structure Theorem.
We present a combinatorial model for cluster algebras of type $D_n$ in terms of centrally symmetric pseudotriangulations of a regular $2n$-gon with a small disk in the centre. This model provides convenient and uniform interpretations for…
We propose and analyse a general tensor-based framework for incorporating second order features into network measures. This approach allows us to combine traditional pairwise links with information that records whether triples of nodes are…