Related papers: On the embedded Nash problem
We revisit the problem of resolution of singularities of toric curves by iterating Nash modification. We give a bound on the number of iterations required to obtain the resolution. We also introduce a different approach on counting…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…
Approximate solutions to various NP-hard combinatorial optimization problems have been found by learned heuristics using complex learning models. In particular, vertex (node) classification in graphs has been a helpful method towards…
We prove that, for a generic set of smooth prescription functions $h$ on a closed ambient manifold, there always exists a nontrivial, smooth, closed hypersurface of prescribed mean curvature $h$. The solution is either an embedded minimal…
Understanding how singularities behave under small perturbations is a central theme in singularity theory. In this paper we establish sufficient conditions for families of analytic function-germs on a germ of a complex analytic space to…
In this work we study some properties and applications of Nash manifolds with corners. Our first main result shows how to `build' a Nash manifold with corners ${\mathcal Q}\subset{\mathbb R}^n$ from a suitable Nash manifold…
We classify semi-algebraic surfaces in $\mathbb{R}^n$ with isolated singularities up to bi-Lipschitz homeomorphisms with respect to the inner distance. In particular, we obtain complete classifications for the Nash surfaces and the complex…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common…
Warped products are one of the simplest families of Riemannian manifolds that can have non-trivial geometries. In this article, we characterize the geometry of hypersurface embeddings arising from warped product manifolds using the language…
We consider the class of Levi nondegenerate hypersurfaces $M$ in $\bC^{n+1}$ that admit a local (CR transversal) embedding, near a point $p\in M$, into a standard nondegenerate hyperquadric in $\Bbb C^{N+1}$ with codimension $k:=N-n$ small…
The geometric Cauchy problem for a class of surfaces in a pseudo-Riemannian manifold of dimension 3 is to find the surface which contains a given curve with a prescribed tangent bundle along the curve. We consider this problem for constant…
The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…
The embedding is an essential step when calculating on the D-Wave machine. In this work we show the hardness of the embedding problem for both types of existing hardware, represented by the Chimera and the Pegasus graphs, containing…
The remarkable range of biological forms in and around us, such as the undulating shape of a leaf or flower in the garden, the coils in our gut, or the folds in our brain, raise a number of questions at the interface of biology, physics and…
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…
We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…
In this paper we study a maximization version of the classical Edge Dominating Set (EDS) problem, namely, the Upper EDS problem, in the realm of Parameterized Complexity. In this problem, given an undirected graph $G$, a positive integer…