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

Let $S$ be a closed orientable hyperbolic surface, and let $\mathcal{O}(K,S)$ denote the number of mapping class group orbits of curves on $S$ with at most $K$ self-intersections. Building on work of Sapir [16], we give upper and lower…

A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…

We show that oriented percolation occurs whenever a condition is satisfied called "exponential intersection tails". This condition says that a measure on paths exists for which the probability of two independent paths intersecting in more…

In this paper, we consider rational cuspidal plane curves having at least three cusps. We give an upper bound of the self-intersection number of the proper transforms of such curves via the minimal embedded resolution of the cusps. For a…

We address the problem of bounding from below the self-intersection of integral curves on the projective plane blown-up at general points. In particular, by applying classical deformation theory we obtain the expected bound in the case of…

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…

The definition of the intersection number of a map with a closed manifold can be extended to the case of a closed stratified set such that the difference between dimensions of its two biggest strata is greater than $1$. The set Sigma of…

We show that any set of distinct homotopy classes of simple closed curves on the torus that pairwise intersect at most $k$ times has size $k + O(\sqrt{k} \log k)$. Prior to this work, a lemma of Agol, together with the state of the art…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

We study crossing numbers for systoles of congruence surfaces. Taken as a family of curves on a family of surfaces, we show that the growth rate of their intersection is optimally small among all sets of curves of the same cardinality lying…

We consider a Gaussian random matrix theory in the presence of an external matrix source. This matrix model, after duality (a simple version of the closed/open string duality), yields a generalized Kontsevich model through an appropriate…

We investigate arcs on a pair of pants and present an algorithm to compute the self-intersection number of an arc. Additionally, we establish bounds for the self-intersection number in terms of the word length. We also prove that the…

In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…