English
Related papers

Related papers: Untangling two systems of noncrossing curves

200 papers

A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…

Data Structures and Algorithms · Computer Science 2026-05-28 Chandra Chekuri , Guyslain Naves , Joseph Poremba , F. Bruce Shepherd

We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional…

Data Structures and Algorithms · Computer Science 2016-07-19 Glencora Borradaile , Erin Wolf Chambers , Kyle Fox , Amir Nayyeri

We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove…

Data Structures and Algorithms · Computer Science 2014-02-20 Patrizio Angelini , Giordano Da Lozzo , Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani , Vincenzo Roselli

Suppose N is a compressible boundary component of a compact orientable irreducible 3-manifold M and Q is an orientable properly embedded essential surface in M in which each component is incident to N and no component is a disk. Let VN and…

Geometric Topology · Mathematics 2007-05-23 Martin Scharlemann

An $(n,m)$-graph is a graph with $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n,m)$-graph $G$ to another $(n,m)$-graph $H$ is a vertex mapping that preserves the adjacencies along with their types and directions. The…

Combinatorics · Mathematics 2023-10-17 Soumen Nandi , Sagnik Sen , S Taruni

We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…

Combinatorics · Mathematics 2017-12-21 Sergey Dovgal , Vlady Ravelomanana

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

Combinatorics · Mathematics 2020-06-22 Fabrizio Frati , Michael Hoffmann , Csaba D. Tóth

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

Geometric Topology · Mathematics 2016-05-24 Patricia Cahn , Federica Fanoni , Bram Petri

Let $(M, g)$ be a compact 3-manifold with nonnegative scalar curvature $R_g\geq 0$. The boundary $\partial M$ is diffeomorphic to the boundary of a rotationally symmetric and weakly convex body $\bar{M}$ in $\mathbb{R}^3$. We call…

Differential Geometry · Mathematics 2024-10-29 Xiaoxiang Chai , Gaoming Wang

Fix an abelian variety $A_0$ and a non-isotrivial abelian scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of translates of a fixed finite-rank subgroup of $A_0$, also defined…

Number Theory · Mathematics 2021-10-05 Gabriel Andreas Dill

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where…

Computational Geometry · Computer Science 2021-08-30 Patrizio Angelini , Philipp Kindermann , Andre Löffler , Lena Schlipf , Antonios Symvonis

In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the…

Combinatorics · Mathematics 2020-10-12 Marcel Milich , Torsten Mütze , Martin Pergel

We investigate the nonlinear holomorphic supersymmetry for quantum-mechanical systems on Riemann surfaces subjected to an external magnetic field. The realization is shown to be possible only for Riemann surfaces with constant curvature…

High Energy Physics - Theory · Physics 2009-11-07 Sergey M. Klishevich , Mikhail S. Plyushchay

We consider a self-homeomorphism h of some surface S. A subset F of the fixed point set of h is said to be unlinked if there is an isotopy from the identity to h that fixes every point of F. With Le Calvez' transverse foliations theory in…

Dynamical Systems · Mathematics 2017-03-01 François Béguin , Sylvain Crovisier , Frédéric Le Roux

We study the problem of embedding a guest graph with minimum edge-congestion into a multidimensional grid with the same size as that of the guest graph. Based on a well-known notion of graph separators, we show that an embedding with a…

Discrete Mathematics · Computer Science 2014-03-03 Akira Matsubayashi

Congealing is a flexible nonparametric data-driven framework for the joint alignment of data. It has been successfully applied to the joint alignment of binary images of digits, binary images of object silhouettes, grayscale MRI images,…

Machine Learning · Computer Science 2019-02-05 Marwan Mattar , Michael Ross , Erik Learned-Miller

A multigraph drawn in the plane is non-homotopic if no two edges connecting the same pair of vertices can be continuously deformed into each other without passing through a vertex, and is $k$-crossing if every pair of edges…

Combinatorics · Mathematics 2024-01-22 António Girão , Freddie Illingworth , Alex Scott , David R. Wood

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

Combinatorics · Mathematics 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk

We introduce a special class of supersingular curves over $\mathbb{F}_{p^2}$, characterized by the existence of non-integer endomorphisms of small degree. A number of properties of this set is proved. Most notably, we show that when this…

Number Theory · Mathematics 2020-06-25 Jonathan Love , Dan Boneh