Related papers: Geometric intersections of loops on surfaces
We study certain top intersection products on the Hilbert scheme of points on a nonsingular surface relative to an effective smooth divisor. We find a formula relating these numbers to the corresponding intersection numbers on the…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…
In this paper, we introduce numerical cohomology for arithmetic surfaces, which leads to an absolute version of arithmetic Riemann-Roch formula. As an application, we derive an upper bound for the self-intersection number of relative…
Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…
We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
Given two free homotopy classes $\alpha_1, \alpha_2$ of loops on an oriented surface, it is natural to ask how to compute the minimum number of intersection points $m(\alpha_1, \alpha_2)$ of loops in these two classes. We show that for…
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.
In their recent inspiring paper Mironov and Morozov claim a surprisingly simple expansion formula for the Kontsevich-Witten tau-function in terms of the Schur Q-functions. Here we provide a similar conjecture for the Br\'ezin-Gross-Witten…
We describe each multiple curve on the orientable surface of genus-$g$ with $n$ punctures and one boundary component by using this multiple curve's geometric intersection number with the embedded curves in this surface.
We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given…
We discuss a new approach to computing the standard algebraic operations on homotopy classes of loops in surfaces: the homological intersection number, Goldman's Lie bracket, and the author's Lie cobracket. Our approach uses fillings of the…
We consider the Quot scheme, R_{d}, compactifying the space of degree d maps from the projective line to the Grassmannian of lines. We give an algorithm for computing the degree of R_{d} under a "generalized Pl\"ucker embedding", this is a…
We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
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…