Related papers: The Saturated Subpaths Decomposition in Z 2 : a sh…
We characterize all compact embedded stable minimal capillary surfaces with capillary angle close to either $0$ or $\pi$ that are supported on a complete embedded minimal surface with finite total curvature that is not an affine plane.…
Neural implicit surface representations have recently emerged as popular alternative to explicit 3D object encodings, such as polygonal meshes, tabulated points, or voxels. While significant work has improved the geometric fidelity of these…
The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized kernel (under complexity…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
This paper is the third in a series that researches the Morse Theory, gradient flows, concavity and complexity on smooth compact manifolds with boundary. Employing the local analytic models from \cite{K2}, for \emph{traversally generic…
Given a connected smooth projective surface X over the complex numbers, together with a simple normal crossings divisor D on it, we study finite normal covers Y of X that are unramified outside D. Given moreover a fibration of X onto a…
We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives,…
In the $l$-path vertex cover problem the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that $G-S$ does not contain a path with $l$ vertices. In…
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…
Entanglement properties of purified quantum states are of key interest for two reasons. First, in quantum information theory, minimally entangled purified states define the Entanglement of Purification as a fundamental measure for the…
Simplicial formal maps were introduced in the first paper, (math.QA/0512032), of this series as a tool for studying Homotopy Quantum Field Theories with background a general homotopy 2-type. Here we continue their study, showing how a…
Local properties of the fundamental group of a path-connected topological space can pose obstructions to the applicability of covering space theory. A generalized covering map is a generalization of the classical notion of covering map…
We study linear series on a general curve of genus g, whose images are exceptional with respect to their secant planes. Each such exceptional secant plane is algebraically encoded by an included linear series, whose number of base points…
We introduce a new information-theoretic measure of multipartite quantum/classical correlations $\Delta_P$, by generalizing the entanglement of purification to multipartite states. We provide proofs of its various properties, focusing on…
In this paper we introduce flat grafting as a deformation of quadratic differentials on a surface of finite type that is analogous to the grafting map on hyperbolic surfaces. Flat grafting maps are generic in the strata structure and…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled (2009) and Mustafa and Ray (2010). In this paper, we generalize the framework by extending its…
Geometric predicates are a basic ingredient to implement a vast range of algorithms in computational geometry. Modern implementations employ floating point filtering techniques to combine efficiency and robustness, and state-of-the-art…
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…
We give explicit computational algorithms to construct minimal degree (always $\le 4$) ramified covers of $\Prj^1$ for algebraic curves of genus 5 and 6. This completes the work of Schicho and Sevilla (who dealt with the $g \le 4$ case) on…