Related papers: Self-intersections are empirically Gaussian

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…

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

Let $\gamma$ be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if $\gamma$ is self-overlapping by geometrically constructing a combinatorial word from $\gamma$. More recently, Zipei Nie, in an…

For a vector space $V$ the \emph{intersection graph of subspaces} of $V$, denoted by $G(V)$, is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of $V$ and two distinct vertices are adjacent if…

This article shows that for generic choice of Riemannian metric on a smooth manifold $M$ of dimension four, all prime compact parametrized minimal surfaces within $M$ have self-intersections in general position in the following sense:…

We study the algebraic dynamics of self-correspondences on a curve. A self-correspondence on a (proper and smooth) curve $C$ over an algebraically closed field is the data of another curve $D$ and two non-constant separable morphisms…

For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.

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…

This paper considers how many conjugacy classes of reflections a map can have, under various transitivity conditions. It is shown that for vertex- and for face-transitive maps there is no restriction on their number or size, whereas…

We give an algorithm which computes a presentation for a subgroup, denoted $\AM_{g,1,p}$, of the automorphism group of a free group. It is known that $\AM_{g,1,p}$ is isomorphic to the mapping-class group of an orientable genus-$g$ surface…

We consider two mixed curve $C,C'\subset {\Bbb C}^2$ which are defined by mixed functions of two variables $\bf z=(z_1,z_2)$. We have shown in \cite{MC}, that they have canonical orientations. If $C$ and $C'$ are smooth and intersect…

A group $G$ is said to be intersection-saturated if for every strictly positive integer $n$ and every map $c\colon \mathcal{P}(\{1,\dots, n\})\setminus \emptyset \rightarrow \{0,1\}$, one can find subgroups $H_1,\dots, H_n\leq G$ such that…

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…

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…

We present the construction of some kind of "convex core" for the product of two actions of a group on $\bbR$-trees. This geometric construction allows to generalize and unify the intersection number of two curves or of two measured…

We generalize two classical formulas for complete intersection curves by introducing the the complete intersection discrepancy of a curve as a correction term. The first is a well-known multiplicity formula in singularity theory, due to…

A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…