منابع مشابه
Weighted paths between partitions
Developing from a concern in bioinformatics, this paper analyses alternative metrics between partitions. From both theoretical and applicative perspectives, a seemingly most appropriate distance between any two partitions is HD, which counts the number of atoms finer than either one but not both. While faithfully reproducing the traditional Hamming distance between subsets, HD is very sensible ...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولMeinardus’ theorem on weighted partitions: extensions and a probabilistic proof
The number cn of weighted partitions of an integer n, with parameters (weights) bk, k ≥ 1, is given by the generating function relationship ∑∞ n=0 cnz n = ∏∞ k=1(1− zk)−bk . Meinardus(1954) established his famous asymptotic formula for cn, as n → ∞, under three conditions on power and Dirichlet generating functions for the sequence bk. We give a probabilistic proof of Meinardus’ theorem with we...
متن کاملOn the (co)homology of the Poset of Weighted Partitions
We consider the poset of weighted partitions Πn , introduced by Dotsenko and Khoroshkin in their study of a certain pair of dual operads. The maximal intervals of Πn provide a generalization of the lattice Πn of partitions, which we show possesses many of the well-known properties of Πn. In particular, we prove these intervals are EL-shellable, we show that the Möbius invariant of each maximal ...
متن کاملSpectra and optimal partitions of weighted graphs
The notion of the Laplacian of weighted graphs will be introduced, the eigenvectors belonging to k consecutive eigen-values of which define optimal k-dimensional Euclidean representation of the vertices. By means of these spectral techniques some combinatorial problems concerning minimal (k+ 1)-cuts of weighted graphs can be handled easily with linear algebraic tools. (Here k is an arbitrary in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1972
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-21-1-379-388