Related papers: Making Multicurves Cross Minimally on Surfaces

This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic…

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph $M(i)$ of a generic surface $i:F \to S^3$ is the set of values which are…

We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

We consider surfaces immersed in three-dimensional pseudohermitian manifolds. We define the notion of (p-)mean curvature and of the associated (p-)minimal surfaces, extending some concepts previously given for the (flat) Heisenberg group.…

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

We study the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces with respect to morphisms of a particular kind. We obtain upper bounds for the arithmetic self-intersection number of the dualizing sheaf on…

We consider curves $\gamma : [0, 1]\to\mathbb{R}^3$ endowed with an adapted orthonormal frame $r : [0, 1]\to SO(3)$. We are interested in the cases where the frame is constrained, in the sense that one of its `curvatures' (i.e.,…

We prove that, as $m$ grows, any family of $m$ homotopically distinct closed curves on a surface induces a number of crossings that grows at least like $(m \log m)^2$. We use this to answer two questions of Pach, Tardos and Toth related to…

We introduce a geometric multigrid method for solving linear systems arising from variational problems on surfaces in geometry processing, Gravo MG. Our scheme uses point clouds as a reduced representation of the levels of the multigrid…

Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former…

In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…

We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a…

Given an Artin group $A_\Gamma$, a common strategy in the study of $A_\Gamma$ is the reduction to parabolic subgroups whose defining graphs have small diameter, i.e. showing that $A_\Gamma$ has a specific property if and only if all "small"…

The single-source shortest path problem (SSSP) with nonnegative edge weights is a notoriously difficult problem to solve efficiently in parallel---it is one of the graph problems said to suffer from the transitive-closure bottleneck. In…

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

This paper has two aims. The former is to give an introduction to our earlier work on the Hodge theory of algebraic maps and more generally to some of the main themes of the theory of perverse sheaves and to some of its geometric…