Related papers: How to Reconstruct a Planar Map From its Branching…
A stratified pseudomanifold is normal if its links are connected. A normalization of a stratified pseudomanifold $X$ is a normal stratified pseudomanifold $Y$ together with a finite-to-one projection $n:Y\to X$ satisfying a local condition…
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…
We construct a resolution of the degree-2 Abel-Jacobi map for a regular smoothing of a nodal curve.
We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…
Automated driving in urban scenarios requires efficient planning algorithms able to handle complex situations in real-time. A popular approach is to use graph-based planning methods in order to obtain a rough trajectory which is…
We show how to construct the Hamiltonian structures of any reduction of the Benney chain (dKP) starting from the family of conformal maps associated to it.
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
Ordinary maps satisfy topological recursion for a certain spectral curve $(x, y)$. We solve a conjecture from arXiv:1710.07851 that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often…
Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show…
We introduce a novel gradient descent algorithm extending the well-known Gradient Sampling methodology to the class of stratifiably smooth objective functions, which are defined as locally Lipschitz functions that are smooth on some regular…
Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\mathbf{E}_\mathrm{in}$ and $\mathbf{E}_\mathrm{out}$, to produce an adjacency…
Proves that if a curve has totally split reduction and the corresponding skeleton (as a metric graph) is a chain of loops with generic edge lengths, then every divisor on the graph with imposed ramification at the rightmost vertex $p$ of…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
In this paper, we consider the simplest class of stratified spaces -- linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled…
We construct and analyze solutions to a regularized homogeneous $p$-harmonic map flow equation for general $p \geq 2$. The homogeneous version of the problem is new and features a monotonicity formula extending the one found by Struwe for…