Related papers: Minimum weight disk triangulations and fillings

We prove that random triangulations of types I, II, and III with a simple boundary under the critical Boltzmann weight converge in the scaling limit to the Brownian disk. The proof uses a bijection due to Poulalhon and Schaeffer between…

We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster…

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero…

We investigate the \emph{minimum weight cycle (MWC)} problem in the $\mathsf{CONGEST}$ model of distributed computing. For undirected weighted graphs, we design a randomized algorithm that achieves a $(k+1)$-approximation, for any…

(highly abridged) We define three requirements for accurate simulations that attempt to model circumstellar disks and the formation of collapsed objects (e.g. planets) within them. First, we define a resolution requirement based on the…

Given a weighted $n$-vertex graph $G$ with integer edge-weights taken from a range $[-M,M]$, we show that the minimum-weight simple path visiting $k$ vertices can be found in time $\tilde{O}(2^k \poly(k) M n^\omega) = O^*(2^k M)$. If the…

We introduce and study an infinite random triangulation of the unit disk that arises as the limit of several recursive models. This triangulation is generated by throwing chords uniformly at random in the unit disk and keeping only those…

In this work, we consider $M=(\mathbb{B}^3_r,\bar{g})$ as the Euclidean three-ball with radius $r$ equipped with the metric $\bar{g}=e^{2h}\left\langle , \right\rangle$ conformal to the Euclidean metric. We show that if a free boundary CMC…

We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every…

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…

We give three constructions of a vertex-minimal triangulation of $4$-dimensional real projective space $\mathbb{R}P^4$. The first construction describes a $4$-dimensional sphere on $32$ vertices, which is a double cover of a triangulated…

In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $ n $ non-overlapping weighted disks in the plane. For a given parameter $ \varepsilon \in (0,1]$, the length of the approximate…

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

In this paper we prove a rigidity statement for free boundary minimal surfaces produced via min-max methods. More precisely, we prove that for any Riemannian metric $g$ on the 3-ball $B$ with non-negative Ricci curvature and…

In this paper we prove an extrinsic one-sided curvature estimate for disks embedded in $\mathbb{R}^3$ with constant mean curvature which is independent of the value of the constant mean curvature. We apply this extrinsic one-sided curvature…

In this paper, we prove that every strictly convex 3-ball with nonnegative Ricci-curvature contains at least 3 embedded free-boundary minimal 2-disks for any generic metric, and at least 2 solutions even without genericity assumption. Our…

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2^(O(k)) + k2 * nm) on graphs with n vertices and m…