Related papers: Solving random equations in Garside groups using l…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…

In the present paper, we introduce $\mathbb{Z}_2$-braids and, more generally, $G$-braids for an arbitrary group $G$. They form a natural group-theoretic counterpart of $G$-knots, see \cite{reidmoves}. The underlying idea, used in the…

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to…

For a finite group $G$ and a sufficiently large (but fixed) prime power $q$ coprime to $G$ we obtain asymptotics for the number of regular Galois extensions $L/ \mathbb{F}_q(t)$, with $\mathrm{Gal}(L/\mathbb{F}_q(t)) \cong G$, ramified at a…

We introduce classical and non-deterministic finite automata associated with representations of the braid group. After briefly reviewing basic definitions on finite automata, Coxeter's groups and the associated word problem, we turn to the…

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is…

We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…

A group is called $\Lambda$-free if it has a free Lyndon length function in an ordered abelian group $\Lambda$, which is equivalent to having a free isometric action on a $\Lambda$-tree. A group has a regular free length function in…

Burau representation of the Artin braid group remains as one of the very important representations for the braid group. Partly, because of its connections to the Alexander polynomial which is one of the first and most useful invariants for…

Computer programs, so-called solvers, for solving the well-known Boolean satisfiability problem (Sat) have been improving for decades. Among the reasons, why these solvers are so fast, is the implicit usage of the formula's structural…

For an integer $n \geq 2$, set $B_n$ to be the braid group on $n$ strands and $SB_n$ to be the singular braid group on $n$ strands. $SB_n$ is one of the important group extensions of $B_n$ that appeared in 1998. Our aim in this paper is to…

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…

Let $G$ be the right-angled Artin group associated to the flag complex $\Sigma$ and let $\pi:G\to\Z$ be its canonical height function. We investigate the presentation theory of the groups $\Gamma_n=\pi^{-1}(n\Z)$ and construct an algorithm…

In this paper we give an algorithm for computing the conjugacy growth series for a right-angled Artin group, based on a natural language of minimal length conjugacy representatives. In addition, we provide a further language of unique…

Let $G$ be a Garside group with Garside element $\Delta$, and let $\Delta^m$ be the minimal positive central power of $\Delta$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $\Delta$. In this paper, we study…

Let $g$ be an element of a finite group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots,g]$ over $x\in G$, where $g$ is repeated $n$ times. By Baer's theorem, if $E_n(g)=1$,…

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…