Related papers: A knotted minimal tree

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…

We prove that for any finite tree $T$ with $n$ vertices and maximal degree $3$, there is a topological embedding of $T$ into the integer grid $Z^2$ which maps vertices to vertices and whose image meets at most $\frac{7}{3}n$ vertices. This…

Let V be a finite set and M a collection of subsets of V. Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V, then the elements of M are called…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists…

The ribbon number $r(K)$ of a ribbon knot $K \subset S^3$ is the minimal number of ribbon intersections contained in any ribbon disk bounded by $K$. We find new lower bounds for $r(K)$ using $\det(K)$ and $\Delta_K(t)$, and we prove that…

We construct a family of compact free boundary minimal annuli immersed in the unit ball $\mathbb{B}^3$ of $\mathbb{R}^3$, the first such examples other than the critical catenoid. This solves a problem formulated by Nitsche in 1985. These…

A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…

We construct a sequence of compact embedded minimal disks in a ball in Euclidean 3-space, whose boundaries lie in the boundary of the ball, such that the curvature blows up only at a prescribed discrete (and hence, finite) set of points on…

We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manifold bounds a surface of genus at most $g$ is in co-NP. This answers a question of Agol, Hass, and Thurston in 2002. Previously, this was…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

Given a thin strip of paper, tie a knot, connect the ends, and flatten into the plane. This is a physical model of a folded ribbon knot in the plane, first introduced by Louis Kauffman. We study the folded ribbonlength of these folded…

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…

The nonorientable four-ball genus of a knot $K$ in $S^3$ is the minimal first Betti number of nonorientable surfaces in $B^4$ bounded by $K$. By amalgamating ideas from involutive knot Floer homology and unoriented knot Floer homology, we…

We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…