Related papers: Complexity of relations in the braid group

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

We estimate from above the set of knots, $\Omega(n,\mu)$, generated by closure of n-string 1+1- and 2+1-dimensional braids of irreducible length $\mu$ ($\mu>>1$) in the limit n>>1.

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in…

This paper is the first part of a series of papers aimed at improving the classification by Formanek of the irreducible representations of Artin braid groups of small dimension. In this paper we classify all the irreducible complex…

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…

In \cite{Manturov} the second author defined the $k$-free braid group with $n$ strands $G_{n}^{k}$. These groups appear naturally as groups describing dynamical systems of $n$ particles in some "general position". Moreover, in…

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Consider the unit ball, B = D x [0,1], containing n unknotted arcs a_1, ... a_n such that the boundary of each a_i lies in D x {0}. We give a finite presentation for the mapping class group of B fixing the arcs {a_1, ..., a_n} setwise and…

A word $\sigma=\sigma_1...\sigma_n$ over the alphabet $[k]=\{1,2,...,k\}$ is said to be {\em smooth} if there are no two adjacent letters with difference greater than 1. A word $\sigma$ is said to be {\em smooth cyclic} if it is a smooth…

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.

We describe Artin's braid group on a (fixed) finite number of strings as a crossed module over itself. In particular, we interpret the braid relations as crossed module structure relations.

We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give…

We construct two families of representations of the braid group $B_n$ by considering conjugation actions on congruence subgroups of $GL_{n-1}(Z[t^{\pm 1},q^{\pm 1}])$. We show that many of these representations are faithful modulo the…

We compute explicitly the monodromy representations of "cyclotomic" analogs of the Knizhnik--Zamolodchikov differential system. These are representations of the type B braid group $B_n^1$. We show how the representations of the braid group…

Presentations are computed for a braided version BV of Thompson's group V and for V itself showing that there is an Artin group/Coxeter group relation between them. The presentation for V is obtained from that for BV by declaring all that…

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

Let $G_{1}$, $G_{2}$, ... be a sequence of groups each of which is either an alternating group, a symmetric group or a cyclic group and construct a sequence $(W_{i})$ of wreath products via $W_{1} = G_{1}$ and, for each $i \geq 1$, $W_{i+1}…

We study the representations of the commutator subgroup of the braid group with n strands in the symmetric group of degree r. Motivated by some experimental results, we conjecture that for n>r, every such representation is trivial.

We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…

We propose a definition by generators and relations of the rank $n-2$ Askey-Wilson algebra $\mathfrak{aw}(n)$ for any integer $n$, generalising the known presentation for the usual case $n=3$. The generators are indexed by connected subsets…