相关论文: Cookie cutters: Bisections with fixed shapes
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve approximately the graph bisection problem. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut…
In this paper, we prove the existence of a measure-preserving bijection from unit square to unit segment. This bijection is also called the probability isomorphism between two probability spaces. Then we give a new proof of the existence of…
The aim of the paper is to propose a bounded-error quantum polynomial time (BQP) algorithm for the max-bisection and the min-bisection problems. The max-bisection and the min-bisection problems are fundamental NP-hard problems. Given a…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
In this paper, the decades-old clustering method k-means is revisited. The original distortion minimization model of k-means is addressed by a pure stochastic minimization procedure. In each step of the iteration, one sample is tentatively…
We give exact and approximation algorithms for two-center problems when the input is a set $\mathcal{D}$ of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in $\mathcal{D}$…
This paper studies cutting and pasting groups (SK-groups) of pairs of manifolds. By a pair of manifolds we mean a manifold with a submanifold of strictly smaller dimension. Existing results in the unoriented category by Komiya are…
Given two sets of points $A$ and $B$ in a normed plane, we prove that there are two linearly separable sets $A'$ and $B'$ such that $\mathrm{diam}(A')\leq \mathrm{diam}(A)$, $\mathrm{diam}(B')\leq \mathrm{diam}(B)$, and $A'\cup B'=A\cup B.$…
The linear-time ham-sandwich cut algorithm of Lo, Matou\v{s}ek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in the dual line arrangement with a set of well-chosen…
We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…
We study unimodular measures on the space $\mathcal M^d$ of all pointed Riemannian $d$-manifolds. Examples can be constructed from finite volume manifolds, from measured foliations with Riemannian leaves, and from invariant random subgroups…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
In this paper, we prove that all doubling measures on the unit disk $\mathbb{D}$ are Carleson measures for the standard Dirichlet space $\mathcal{D}$. The proof has three ingredients. The first one is a characterization of Carleson measures…
A powerful tool for studying geometrical problems in Hilbert space is developed. In particular, we study the quantum pure state tomography problem in finite dimensions from the point of view of dynamical systems and bifurcations theory.…
Positiveness of scalar curvature and Ricci curvature requires vanishing the obstruction $\theta(M)$ which is computed in some KK-theory of C*-algebras index as a pairing of spin Dirac operator and Mishchenko bundle associated to the…
We establish the existence of infinitely many complete metrics with constant scalar curvature on prescribed conformal classes on certain noncompact product manifolds. These include products of closed manifolds with constant positive scalar…
The statistics of local measurements of joint quantum systems can sometimes be used to distinguish the spatiotemporal structure in which they were measured. We first prove that every bipartite separable density matrix is temporally…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
For a given metric measure space $(X,d,\mu)$ we consider finite samples of points, calculate the matrix of distances between them and then reconstruct the points in some finite-dimensional space using the multidimensional scaling (MDS)…