Related papers: Thurston's Operations on the Braid Groups
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…
Starting from an extension of the Poisson bracket structure and Kubo-Martin-Schwinger-property of classical statistical mechanics of continuous systems to spin systems, defined on a lattice, we derive a series of, as we think, new and…
This paper is a survey of some properties of the braid groups and related groups that lead to questions on mapping class groups.
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…
We present a generalization of the Dehornoy-Brin braided Thompson group $BV_2$ that uses recursive braids. Our new groups are denoted by $BV_{n,r}(H)$, for all $n\geq 2,r\geq 1$ and $H \leq \mathcal{B}_n$, where $\mathcal{B}_n$ is the braid…
We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…
We review the exact results for microscopic Dirac operator spectra based on either Random Matrix Theory, or, equivalently, chiral Lagrangians. Implications for lattice calculations are discussed.
It is a classical result in representation theory that the braid group $\mathscr{B}_\mathfrak{g}$ of a simple Lie algebra $\mathfrak{g}$ acts on any integrable representation of $\mathfrak{g}$ via triple products of exponentials in its…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
Motivated by connections to the singlet vertex operator algebra in the $\mathfrak{g}=\mathfrak{sl}_2$ case, we study the unrolled restricted quantum groups $\overline{U}_q^H(\mathfrak{g})$ at arbitrary roots of unity with a focus on its…
We are concerned with mapping class groups of surfaces with nonempty boundary. We present a very natural method, due to Thurston, of finding many different left orderings of such groups. The construction involves equipping the surface with…
In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the…
We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…
In this thesis I develop a formalism whereby a tensor network may be understood in terms of a unitary braided tensor category, and represented in a particularly efficient manner corresponding to the exploitation of this mathematical…
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…
Withdrawn and replaced by two related manuscripts: (1) "Stabilization in the braid groups I:MTWS", published in Geometry and Topology Volume 10 (2006), 413-540, arXiv:math.GT/0310279, and (2) "Stabilization in the braid groups II:…
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…