Related papers: Self-intersections are empirically Gaussian

Given a compact orientable surface $\Sigma$, let $\Cal S(\Sigma)$ be the set of isotopy classes of essential simple loops on $\Sigma$. We determine a complete set of relations for a function from $\Cal S(\Sigma)$ to $\bold Z$ to be a…

A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…

Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…

We study the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces with respect to morphisms of a particular kind. We obtain upper bounds for the arithmetic self-intersection number of the dualizing sheaf on…

This is the second in a series of papers. Here we develop here an intersection theory for manifolds equipped with an action of a finite group. As in our previous paper, our approach will be homotopy theoretic, enabling us to circumvent the…

We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure (`length') of nodal intersections against a smooth 2-dimensional toral sub-manifold (`surface'). The…

On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…

The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…

We determine necessary conditions for ample divisors in arbitrary genus as well as for very ample divisors in genus 2 and 3. We also compute the intersection numbers $\lambda^9$ and $\lambda_{g-1}^3$ in genus 4. The latter number is…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

The free $\mathbb{Z}$-module generated from the set of non-trivial homotopy classes of closed curves on an oriented surface has the structure of Lie bialgebra by two operations, the Goldman bracket and Turaev cobracket. M. Chas gave a…

I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph $M(i)$ of a generic surface $i:F \to S^3$ is the set of values which are…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…

Gay and Kirby introduced trisections which describe any closed oriented smooth 4-manifold $X$ as a union of three four-dimensional handlebodies. A trisection is encoded in a diagram, namely three collections of curves in a closed oriented…

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

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 intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

This article introduces efficient and user-friendly tools for analyzing the intersection curve between a ringed torus and an irreducible quadric surface. Without loose of generality, it is assumed that the torus is centered at the origin,…