Related papers: Cookie cutters: Bisections with fixed shapes
We analyze to what extent it is possible to copy arbitrary states of a two-level quantum system. We show that there exists a "universal quantum copying machine", which approximately copies quantum mechanical states in such a way that the…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
We consider the problem of comparing the volumes of two star bodies in an even-dimensional euclidean space $\mathbb R^{2n} = \mathbb C^n$ by comparing their cross sectional areas along complex lines (special 2-dimensional real planes)…
The d-Cut problem is to decide if a graph has an edge cut such that each vertex has at most d neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The d-Cut problem has been studied…
We express notions of K-stability of polarized spherical varieties in terms of combinatorial data, vastly generalizing the case of toric varieties. We then provide a combinatorial sufficient condition of G-uniform K-stability by studying…
The aim of this paper is to study the full $K-$moment problem for measures supported on some particular non-linear subsets $K$ of an infinite dimensional vector space. We focus on the case of random measures, that is $K$ is a subset of all…
The alternating sign matrices-descending plane partitions (ASM-DPP) bijection problem is one of the most intriguing open problems in bijective combinatorics, which is also relevant to integrable combinatorics. The notion of a signed set and…
Recently there has been interest in pairs of Banach spaces $(E_0,E)$ in an $o-O$ relation and with $E_0^{**}=E$. It is known that this can be done for Lipschitz spaces on suitable metric spaces. In this paper we consider the case of a…
In this paper we give a unified treatment of two different definitions of complementarity partition of multifold conic programs introduced independently in [J. F. Bonnans and H. Ram\'irez C., Math. Program. 104 (2005), no. 2-3, Ser. B,…
We study the problem of transforming bipartite graphs into bicluster graphs. Abu-Khzam, Isenmann, and Merchad [IWOCA '25] introduced two variants of this problem. In both problems, the goal is to transform a bipartite graph into a bicluster…
Let X be a real or complex Hilbert space of finite but large dimension d, let S(X) denote the unit sphere of X, and let u denote the normalized uniform measure on S(X). For a finite subset B of S(X), we may test whether it is approximately…
We show that, for any prime power n and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into n convex sets with equal volumes and equal surface areas. Similar results regarding…
Biclustering, also called co-clustering, block clustering, or two-way clustering, involves the simultaneous clustering of both the rows and columns of a data matrix into distinct groups, such that the rows and columns within a group display…
Let $(X,d,\mu )$ be a space of homogeneous type in the sense of Coifman and Weiss, i.e. $d$ is a quasi metric on $X$ and $\mu $ is a positive measure satisfying the doubling condition. Suppose that $u$ and $v$ are two locally finite…
Scaling clustering algorithms to massive data sets is a challenging task. Recently, several successful approaches based on data summarization methods, such as coresets and sketches, were proposed. While these techniques provide provably…
Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…
A partition $\mathcal{P}$ of $\mathbb{R}^d$ is called a $(k,\varepsilon)$-secluded partition if, for every $\vec{p} \in \mathbb{R}^d$, the ball $\overline{B}_{\infty}(\varepsilon, \vec{p})$ intersects at most $k$ members of $\mathcal{P}$. A…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…