相关论文: Cookie cutters: Bisections with fixed shapes
These series of notes serve as an introduction to some of both the classical and modern techniques in Reifenberg theory. At its heart, Reifenberg theory is about studying general sets or measures which can be, in one sense or another,…
In the Minimum Bisection problem, input is a graph $G$ and the goal is to partition the vertex set into two parts $A$ and $B$, such that $||A|-|B|| \le 1$ and the number $k$ of edges between $A$ and $B$ is minimized. This problem can be…
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…
We consider a geometric combinatorial problem naturally associated to the geometric topology of certain spherical space forms. Given a collection of $m$ mass distributions on $\mathbb{R}^n$, the existence of $k$ affinely independent regular…
For a given planar convex compact set $K$, consider a bisection $\{A,B\}$ of $K$ (i.e., $A\cup B=K$ and whose common boundary $A\cap B$ is an injective continuous curve connecting two boundary points of $K$) minimizing the corresponding…
The K-Modes algorithm, developed for clustering categorical data, is of high algorithmic simplicity but suffers from unreliable performances in clustering quality and clustering efficiency, both heavily influenced by the choice of initial…
Let $T\subset{\mathbb R}^n$ be a fixed set. By a scaled copy of $T$ around $x\in{\mathbb R}^n$ we mean a set of the form $x+rT$ for some $r>0$. In this survey paper we study results about the following type of problems: How small can a set…
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…
Inspired by a formula of Stern that relates scalar curvature to harmonic functions, we evaluate the mass of an asymptotically flat $3$-manifold along faces and edges of a large coordinate cube. In terms of the mean curvature and dihedral…
We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…
The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions…
Identifying clusters of similar objects in data plays a significant role in a wide range of applications. As a model problem for clustering, we consider the densest k-disjoint-clique problem, whose goal is to identify the collection of k…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
We study local rigidity and multiplicity of constant scalar curvature metrics in arbitrary products of compact manifolds. Using (equivariant) bifurcation theory we determine the existence of infinitely many metrics that are accumulation…
We discuss smooth metric measure spaces admitting two weighted Einstein representatives of the same weighted conformal class. First, we describe the local geometries of such manifolds in terms of certain Einstein and quasi-Einstein warped…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…
Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…
This paper studies iterative schemes for measure transfer and approximation problems, which are defined through a slicing-and-matching procedure. Similar to the sliced Wasserstein distance, these schemes benefit from the availability of…
This paper is concerned with the study of Besov-type decomposition spaces, which are scales of spaces associated to suitably defined coverings of the euclidean space $\mathbb{R}^d$, or suitable open subsets thereof. A fundamental problem in…