Related papers: The Pants Complex Has Only One End

A closed hyperbolic surface of genus $g\ge 2$ can be decomposed into pairs of pants along shortest closed geodesics and if these curves are sufficiently short (and with lengths uniformly bounded away from 0), then the geometry of the…

We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

We prove the compactness of self-shrinkers in $\mathbb R^3$ with bounded entropy and fixed genus. As a corollary, we show that numbers of ends of such surfaces are uniformly bounded by the entropy and genus.

In this paper we apply a geometric covering method to study the number of ends on shrinkers. On one hand, we prove that the number of ends on any complete non-compact shrinker is at most polynomial growth with fixed degree. On the other…

Let $X$, $Y$ be Fano threefolds of Picard number one and such that the ample generators of Picard groups are very ample. Let $X$ be of index one and $Y$ be of index two. It is shown that the only morphisms from $X$ to $Y$ are double…

After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.

We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…

It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants…

We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…

Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…

It is proved that the curve graph $C^1(\Sigma)$ of a surface $\Sigma_{g,n}$ has a local pathology that had not been identified as such: there are vertices $\alpha,\beta$ in $C^1(\Sigma)$ such that $\beta$ is a dead end of every geodesic…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

We establish that, given $\Sigma$ a compact orientable surface, and $G$ a finitely presented one-ended group, the set of copies of $G$ in the mapping class group $\mathcal{MCG}(\Sigma)$ consisting of only pseudo-anosov elements except…

We show that minimal length carrier graphs are not unique, but if M is in a large class of hyperbolic 3-manifolds, including the geometrically finite ones, then M has only finitely many minimal length carrier graphs and no two of them are…

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…