Related papers: On the embedded Nash problem
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
Immersion minor is an important variant of graph minor, defined through an injective mapping from vertices in a smaller graph $H$ to vertices in a larger graph $G$ where adjacent elements of the former are connected in the latter by…
The problem of characterizing the structure of an elastic network constrained to lie on a frozen curved surface appears in many areas of science and has been addressed by many different approaches, most notably, extending linear elasticity…
A rectangle visibility representation (RVR) of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its…
Branes are embedded surfaces in a given background (bulk) spacetime. Assuming a warped bulk, we investigate, in analogy with the case for geodesics, the notion of {\em focusing} of families of such embedded, extremal 3--branes in a five…
Embedding into hyperbolic space is emerging as an effective representation technique for datasets that exhibit hierarchical structure. This development motivates the need for algorithms that are able to effectively extract knowledge and…
We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…
The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…
Let p be a singular point of a complex hypersurface whose tangent cone is a quadric of rank at least 3. We show that the space of arcs through p is irreducible. Using a method of de Fernex, this shows that the Nash problem has a negative…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…
We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once. We show that MSE can…
A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph…
Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…
We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…
We construct examples of non-isotrivial algebraic families of smooth complex projective curves over a curve of genus 2. This solves a problem from Kirby's list of problems in low-dimensional topology. Namely, we show that 2 is the smallest…
In applications, a substantial number of problems can be formulated as non-linear least squares problems over smooth varieties. Unlike the usual least squares problem over a Euclidean space, the non-linear least squares problem over a…
This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
Families of jets through singularities of algebraic varieties are here studied in relation to the families of arcs originally studied by Nash. After proving a general result relating them, we look at normal locally complete intersection…