Related papers: Units of the String Link Monoids
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
We quantize the bending deformations of n-gon linkages by linearizing the bending fields at a degenerate n-gon to get a representation of the Malcev Lie algebra of the pure braid group. This linearization yields a flat connection on the…
We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
We construct a homomorphism $f$ from the braid group $B_{2n+2}$ on $2n+2$ strands to the Steinberg group associated with the Lie type $C_n$ and with integer coefficients. This homomorphism lifts the well-known symplectic representation of…
We show that the exterior powers of the matrix valued random walk invariant of string links, introduced by Lin, Tian, and Wang, are isomorphic to the graded components of the tangle functor associated to the Alexander Polynomial by Ohtsuki…
We extend Jones' construction to obtain a surjective map from the Brown-Thompson group $F_3$ to the set of pointed links up to pointed isotopy. We then introduce an operation on $F_3$, and use it to define a new monoid $(F_3, \diamond)$,…
In this paper, we investigate some applications of commutator subgroups to homotopy groups and geometric groups. In particular, we show that the intersection subgroups of some canonical subgroups in certain link groups modulo their…
If G is a finite graph and n is a natural number, then the n-strand braid group of G is the fundamental group of the configuration space of n points on G. This article gives a complete computation of the integral cohomology rings of the…
Let $\mathcal{C}_d\subset \mathbb{C}^{d+1}$ be the space of non-singular, univariate polynomials of degree $d$. The Vi\`{e}te map $\mathscr{V} : \mathcal{C}_d \rightarrow Sym_d(\mathbb{C})$ sends a polynomial to its unordered set of roots.…
This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…
We prove that if g and n are integers at least two, then the abstract commensurator of the braid group with n strands on a closed orientable surface of genus g is naturally isomorphic to the extended mapping class group of a compact…
We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…
We study the algebraic structures of the virtual singular braid monoid, $VSB_n$, and the virtual singular pure braid monoid, $VSP_n$. The monoid $VSB_n$ is the splittable extension of $VSP_n$ by the symmetric group $S_n$. We also construct…
Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G…
Generalizing results of Frucht and de Groot/Sabidussi, we demonstrate that every group-embeddable monoid is isomorphic to the bimorphism monoid of some graph.
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the…
In this article we calculate the n-string braid groups of certain non-contractible graphs. We use techniques from the work of A. Abrams, F. Connolly and M. Doig combined with Van Kampen's Theorem to prove these results.
We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…
We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.