Related papers: Partitions of unity

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…

We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…

In the paper, we generalize the Arzel\`a-Ascoli theorem in the setting of uniform spaces. At first, we recall well-known facts and theorems coming from monographs of Kelley and Willard. The main part of the paper introduces the notion of…

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…

We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.

We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…

In this work, I develop a new view of presentation theory for C*-algebras, both unital and non-unital, heavily grounded in classical notions from algebra. In particular, I introduce Tietze transformations for these presentations, which lead…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…