Related papers: Self-intersections in combinatorial topology: stat…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard two-dimensional flat torus ("arithmetic random waves") with a fixed real-analytic reference curve with nonvanishing curvature. The…
We study the geometric and combinatorial effect of smoothing an intersection point in a collection of arcs or curves on a surface. We prove that all taut arcs with fixed endpoints and all taut 1-manifolds with at least two non-disjoint…
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…
We consider intersecting hypersurfaces in curved spacetime with gravity governed by a class of actions which are topological invariants in lower dimensionality. Along with the Chern-Simons boundary terms there is a sequence of intersection…
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
We obtain a formula for the number of genus one curves with a fixed complex structure of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed…
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
Consider a directed graph (digraph) in which vertices are assigned color sets, and two vertices are connected if and only if they share at least one color and the tail vertex has a strictly smaller color set than the head. We seek to…
We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard three-dimensional flat torus with a fixed smooth reference curve, which has nowhere vanishing curvature. The expected intersection…
The conjugate locus of a point $p$ in a surface $\mathcal{S}$ will have a certain number of cusps. As the point $p$ is moved in the surface the conjugate locus may spontaneously gain or lose cusps. In this paper we explain this…
For a smooth projective curve, the cycles of subordinate or, more generally, secant divisors to a given linear series are among some of the most studied objects in classical enumerative geometry. We consider the intersection of two such…
Regular homotopy classes of immersions of a 3-sphere in 5-space constitute an infinite cyclic group. The classes containing embeddings form a subgroup of index 24. The obstruction for a generic immersion to be regularly homotopic to an…
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…
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.…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
When can a map between manifolds be deformed away from itself? We describe a (normal bordism) obstruction which is often computable and in general much stronger than the classical primary obstruction in cohomology. In particular, it answers…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…