Related papers: Intersection numbers in the curve graph with a uni…
We construct pairs of elliptic curves over number fields with large intersection of projective torsion points.
Measuring the topological overlap of two graphs becomes important when assessing the changes between temporally adjacent graphs in a time-evolving network. Current methods depend on the fraction of nodes that have persisting edges. This…
Let $(\Sigma, g)$ be a closed, oriented, negatively curved surface, and fix pairwise disjoint simple closed geodesics $\gamma_{\star,1}, \dots \gamma_{\star, r}$. We give an asymptotic growth as $L \to +\infty$ of the number of primitive…
In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple directed graph. Moreover, a realization of a realizable sequence…
Isotropic Quot schemes parameterize rank $r$ isotropic subsheaves of a vector bundle equipped with symplectic or symmetric quadratic form. We define a virtual fundamental class for isotropic Quot schemes over smooth projective curves. Using…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
Geodesic currents on closed hyperbolic surfaces are measures on the unit tangent bundle invariant under geodesic flow and orientation reversal. Every geodesic current induces a dual function on curves via the geometric intersection pairing.…
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of…
Traffic safety at intersections is studied quantitatively using methods from Statistical Mechanics on the basis of simple microscopic traffic flow models. In order to determine a relationship between traffic flow and the number of crashes,…
Two free homotopy classes of closed curves in an orientable surface with negative Euler characteristic are said to be length equivalent if for any hyperbolic structure on the surface, the length of the geodesic in one class is equal to the…
We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k-connectivity,…
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…
We consider an obstacle problem for elastic curves with fixed ends. We attempt to extend the graph approach provided in [8]. More precisely, we investigate nonexistence of graph solutions for special obstacles and extend the class of…
Identifying parallel sides of a collection of Euclidean polygons yields a flat surface with cone points of angles multiples of 2 pi, naturally a compact Riemann surface but also an algebraic curve, and a hyperbolic surface. In general two…
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…
The well known formulas express the curvature and the torsion of a curve in $R^3$ in terms of euclidean invariants of its derivatives. We obtain expressions of this kind for all curvatures of curves in $R^n$. It follows that a curve in…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
We consider problems related to finding short cycles, small cliques, small independent sets, and small subgraphs in geometric intersection graphs. We obtain a plethora of new results. For example: * For the intersection graph of $n$ line…
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…