Related papers: Geometric embeddings of braid groups do not merge …
We show that the group cohomology of the diffeomorphisms of the disk with $n$ punctures has the cohomology of the braid group of $n$ strands as the summand. As an application of this method, we also prove that there is no cohomological…
We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…
Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
Let M be a compact, connected non-orientable surface without boundary and of genus g greater than or equal to 3. We investigate the pure braid groups P_n(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact…
We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…
We say that a germ G of a geometric structure can be transplanted into a manifold M if there is a suitable geometric structure on M which agrees with G on a neighborhood of some point P of M. We show for a wide variety of geometric…
The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…
Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The…
Let $m\leq n\in \mathbb{N}$, and $G\leq S_m$ and $H\leq S_n$. In this article we find conditions enabling embeddings between the symmetric R. Thompson groups $V_m(G)$ and $V_n(H)$. When $n\equiv 1 \mod(m-1)$ and under some other technical…
By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…
We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free…
When a solenoid is embedded in three space, its complement is an open three manifold. We discuss the geometry and fundamental groups of such manifolds, and show that the complements of different solenoids (arising from different inverse…
In this article, we give a necessary and sufficient condition for embedding a finite index subgroup of Artin's braid group into the mapping class group of a connected orientable surface.
In this paper we study embeddings of contact manifolds using braidings of one manifold about another. In particular we show how to embed many contact 3-manifolds into the standard contact 5-sphere. We also show how to obstruct braidings of…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…
The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…