Related papers: Partition distances
Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…
Originally introduced as the difference between two possible forms of quantum mutual information, quantum discord has posteriorly been shown to admit a formulation according to which it measures a distance between the state under scrutiny…
In this work, we consider the problem of synchronizing two sets of data where the size of the symmetric difference between the sets is small and, in addition, the elements in the symmetric difference are related through the Hamming distance…
The geometric measure of entanglement of a pure quantum state is defined to be its distance to the space of product (seperable) states. Given an $n$-partite system composed of subsystems of dimensions $d_1,\ldots, d_n$, an upper bound for…
In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…
We prove several inequalities estimating the distance between volumes of two bodies in terms of the maximal or minimal difference between areas of sections or projections of these bodies. We also provide extensions in which volume is…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
We consider a simple model of the dynamics of a single electron in a crystal lattice. Although this is a standard problem in condensed matter physics, alternative ways of evaluating a partition function for such a system lead to equalities,…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
Let $\mathcal{P}$ and $\mathcal{P}'$ be finite partitions of the set $V$. Finding good correspondences between the parts of $\mathcal{P}$ and those of $\mathcal{P}'$ is helpful in classification, pattern recognition, and network analysis.…
We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS in $C^d\otimes C^d$ (symmetric qudits) can be…
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
Consider the partition function S(\epsilon) associated in theory of Renyi dimension to a finite Borel measure \mu on Euclidean d-space. This partion function S(\epsilon) is the sum of the q-th powers of the measure applied to a partition of…
Optimal transport and its related problems, including optimal partial transport, have proven to be valuable tools in machine learning for computing meaningful distances between probability or positive measures. This success has led to a…
Multipartite entanglement is a valuable resource for quantum technologies. However, detecting this resource can be challenging: for genuine multipartite entanglement, the detection may require global measurements that are hard to implement…
It is known that a reliable geometric quantifier of discord-like correlations can be built by employing the so-called trace distance. This is used to measure how far the state under investigation is from the closest "classical-quantum" one.…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that…