Related papers: Self-intersections in combinatorial topology: stat…

We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for…

We show that in two dimensional flat tori the number of intersections between random eigenfunctions of general eigenvalues and a given smooth curve is almost exponentially concentrated around its mean, even when the randomness is not…

Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…

We classify the topological types of surfaces in the 3-dimensional unit sphere that contain both a great and a small circle through each point. In particular, these surfaces are homeomorphic to one of five normal forms and are either the…

We prove the connectedness and calculate the diameter of the oriented graph of graftings associated to exotic complex projective structures on a compact surface S with a given holonomy representation of Fuchsian type. The oriented graph of…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

A graph class is monotone if it is closed under taking subgraphs. It is known that a monotone class defined by finitely many obstructions has bounded treewidth if and only if one of the obstructions is a so-called tripod, that is, a…

We present a topological recursion formula for calculating the intersection numbers defined on the moduli space of open Riemann surfaces. The spectral curve is $x = \frac{1}{2}y^2$, the same as spectral curve used to calculate intersection…

A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…

We say that a group $G$ of local (maybe formal) biholomorphisms satisfies the uniform intersection property if the intersection multiplicity $(\phi (V), W)$ takes only finitely many values as a function of $G$ for any choice of analytic…

On an orientable surface $S$, consider a collection $\Gamma$ of closed curves. The (geometric) intersection number $i_S(\Gamma)$ is the minimum number of self-intersections that a collection $\Gamma'$ can have, where $\Gamma'$ results from…

A graph $G=(V,E)$ is a geometric intersection graph if every node $v \in V$ is identified with a geometric object of some particular type, and two nodes are adjacent if the corresponding objects intersect. Geometric intersection graph…

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the…

Let $\Sigma$ be a surface of negative Euler characteristic and $S$ a generating set for $\pi_1(\Sigma,p)$ consisting of simple loops that are pairwise disjoint (except at $p$). We show that the word length with respect to $S$ of an element…

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…

Each free homotopy class of directed closed curves on a surface with boundary can be described by a cyclic reduced word in the generators of the fundamental group and their inverses. The word length is the number of letters of the cyclic…

We study the nodal intersections number of random Gaussian toral Laplace eigenfunctions ("arithmetic random waves") against a fixed smooth reference curve. The expected intersection number is proportional to the the square root of the…

A road interchange where $n$ roads meet and in which the drivers are not allowed to change lanes can be modelled as an embedding of a 2-coloured (hence bipartite) multigraph $G$ with equal-sized colour classes into an orientable surface…