Related papers: Intersection theory on mixed curves
In this paper, we develop new techniques for understanding surfaces in $\mathbb{CP}^2$ via bridge trisections. Trisections are a novel approach to smooth 4-manifold topology, introduced by Gay and Kirby, that provide an avenue to apply…
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…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
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…
Systems that are not smooth can undergo bifurcations that are forbidden in smooth systems. We review some of the phenomena that can occur for piecewise-smooth, continuous maps and flows when a fixed point or an equilibrium collides with a…
Let $G$ be a group. The intersection graph of cyclic subgroups of $G$, denoted by $\mathscr I_c(G)$, is a graph having all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\mathscr I_c(G)$ are adjacent if and…
Given a reduced analytic space $Y$ we introduce a class of {\it nice} cycles, including all effective $\mathbb{Q}$-Cartier divisors. Equidimensional nice cycles that intersect properly allow for a natural intersection product. Using…
Given a diagram for a trisection of a 4-manifold $X$, we describe the homology and the intersection form of $X$ in terms of the three subgroups of $H_1(\Sigma;\mathbb{Z})$ generated by the three sets of curves and the intersection pairing…
In a recent work of Duke, Imamo\={g}lu, and T\'{o}th, the linking number of certain links on the space $\text{SL}(2,\mathbb{Z})\backslash\text{SL}(2,\mathbb{R})$ is investigated. This linking number has an alternative interpretation as the…
A survey of special curves, special subvarieties of $\mathcal{M}_g$, and related topics. A large portion of the text discusses various possible interpretation of the word 'special' in this context by giving also concrete examples. One…
Fixed a point O on a non-singular surface S and a complete mO-primary ideal I in its local ring, the curves on the surface X obtained by blowing-up I are studied in terms of the base points of I. Criteria for the principality of these…
We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…
Given a smooth subscheme of a projective space over a finite field, we compute the probability that its intersection with a fixed number of hypersurface sections of large degree is smooth of the expected dimension. This generalizes the case…
Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…
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.
We classify closed curves on a once-punctured torus with a single self-intersection from a combinatorial perspective. We determine the number of closed curves with given word-length and with zero, one, and arbitrary self-intersections.
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 introduce twelve polynomial invariants for long virtual knots, called intersection polynomials, extending and refining the three intersection polynomials for virtual knots. They are defined via intersection numbers of cycles on a closed…
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…
The celebrated Erdos, Faber and Lovasz conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an…