Related papers: The curve complex as a coset intersection complex
In this paper we will prove a super-analogue of a well-known result by Kontsevich which states that the homology of a certain complex which is generated by isomorphism classes of oriented graphs can be calculated as the Lie algebra homology…
Gromov has shown how to construct holomorphic maps of the plane to a complex manifold with prescribed values on a lattice. In the present paper, a similar interpolation theorem for pseudo-holomorphic maps from the cylinder S to an…
We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices…
We classify surface Houghton groups, as well as their pure subgroups, up to isomorphism, commensurability, and quasi-isometry.
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…
For all but finitely many compact orientable surfaces, we show that any superinjective map from the complex of separating curves into itself is induced by an element of the extended mapping class group. We apply this result to proving that…
We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…
We show that a complex normal surface singularity admitting a contracting automorphism is necessarily quasihomogeneous. We also describe the geometry of a compact complex surface arising as the orbit space of such a contracting…
This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…
Consider a connected orientable surface $S$ of infinite topological type, i.e. with infinitely-generated fundamental group. We describe the large-scale geometry of arbitrary connected subgraphs of the arc complex $A(S)$ and curve complex…
Given a closed, orientable surface $S$ of negative Euler characteristic, we study two automorphism groups: $Aut(\mathscr{C})$ and $Aut(\mathcal{ML})$, groups of homeomorphisms that preserve the intersection form in the space $\mathscr{C}$…
We study the large scale geometry of mapping class groups MCG(S), using hyperbolicity properties of curve complexes. We show that any self quasi-isometry of MCG(S) (outside a few sporadic cases) is a bounded distance away from a…
We give a necessary and sufficient condition for the mapping class group of the pair of the 3-sphere and a graph embedded in it to be isomorphic to the topological symmetry group of the embedded graph.
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
In all possible cases, we prove that local embeddings between two curve complexes whose complexities do not increase from domain to codomain are induced by surface homeomorphism. This is our first main result. From this we can deduce our…
To every affine real arrangement of hyperplanes we associate a family of diagrams of spaces over the face poset of the arrangement. We show that any cover of the complement of the complexification of the arrangement is homotopy equivalent…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
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…