Related papers: Partition distances
Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…
If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…
The sliced Wasserstein distance as well as its variants have been widely considered in comparing probability measures defined on $\mathbb R^d$. Here we derive the notion of sliced Wasserstein distance for measures on an infinite dimensional…
Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…
A flat membrane with given shape is displayed; two points in the membrane are randomly selected; the probability that the separation between the points have a specified value is sought. A simple method to evaluate the probability density is…
A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…
We investigate and compare three distinguished geometric measures of bipartite quantum correlations that have been recently introduced in the literature: the geometric discord, the measurement-induced geometric discord, and the discord of…
The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
A generalization of the geometric measure of quantum discord is introduced in this article, based on Hellinger distance. Our definition has virtues of computability and independence of local measurement. In addition it also does not suffer…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how…
We study the balanced $k$-way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on $n$ nodes, our goal is to partition the node set into $k$ parts of size at most…
We propose a new method to construct maximin distance designs with arbitrary number of dimensions and points. The proposed designs hold interleaved-layer structures and are by far the best maximin distance designs in four or more…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…