We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure. We present an algorithm to compute the centralizer of a braid whose generic-case complexity is quadratic on the length of the input, and which outputs a minimal set of generators in the generic case.
The paper encloses computation of simple centralizer of simple braids and their connection with Fibonacci numbers. Planarity of some commuting graphs is also discussed in the last section.
The goal of this paper is to construct examples of centralizers in the Artin braid groups requiring the number of generators quadratic in the number of strings. These examples disprove a recent conjecture of N. Franco and J. Gonzalez-Meneses.
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 main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed braid groups. Then we construct a generating set of the centralizer of any braid on n strands, which has at most k(k+1)/2 elements if n=2k, and at most $k(k+3)/2 elements if n=2k+1. These bounds are shown to be sharp, due to work of N.V.Ivanov and of S.J.Lee. Finally, we describe how one can explicitly compute this generating set.
We characterize the double centralizer of all parabolic subgroups of the braid groups. We apply this result to provide a new and potentially more efficient solution to the subgroup conjugacy problem for parabolic subgroups. In the course of the proof we also characterize the centralizer for all parabolic subgroups.
We show that any two elements of the pure braid group either commute or generate a free group, settling a question of Luis Paris. Our proof involves the theory of 3-manifolds and the theory of group actions on trees.
We state a conjecture about centralizers of certain roots of central elements in braid groups, and check it for Artin braid groups and some other cases. Our proof makes use of results by Birman-Ko-Lee; we give a new intrinsic account of these results.
We explore when generator-conjugate homomorphisms are conjugate and when element-conjugate homomorphisms are conjugate from abelian or dihedral groups to the symmetric group. We completely determine when such homomorphisms are conjugate in the case where the source group has two generators by studying centralizer actions in the target group.
According to the Tits conjecture proved by Crisp and Paris, [CP], the subgroups of the braid group generated by proper powers of the Artin elements are presented by the commutators of generators which are powers of commuting elements. Hence they are naturally presented as right-angled Artin groups. The case of subgroups generated by powers of the band generators is more involved. We show that the groups are right-angled Artin groups again, if all generators are proper powers with exponent at least 3. We also give a presentation in cases at the other extreme, when all generators occur with expo…
We determine a set of generators for the Brunnian braids on a general surface $M$ for $M\not=S^2$ or $\RP^2$. For the case $M=S^2$ or $\RP^2$, a set of generators for the Brunnian braids on $M$ is given by our generating set together with the homotopy groups of a 2-sphere.
In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard Artin presentation for generalizations of braids. Namely, we consider presentations with small number of generators, Sergiescu graph-presentations and Birman-Ko-Lee presentation. The work of V.V.Chaynikov on the word and conjugacy problems for the singular braid monoid in Birman-Ko-Lee generators is described as well.
In his initial paper on braids E.Artin gave a presentation with two generators for an arbitrary braid group. We give analogues of this Artin's presentation for various generalizations of braids.
In this paper, we give a Gröbner-Shirshov basis of the braid group $B_{n+1}$ in Adyan-Thurston generators. We also deal with the braid group of type $\bf{B}_{n}$. As results, we obtain a new algorithm for getting the Adyan-Thurston normal form, and a new proof that the braid semigroup $B^+_{n+1}$ is the subsemigroup in $B_{n+1}$.
In this paper, we obtain Groebner-Shirshov (non-commutative Gröbner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $δ$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form in the braid groups, and thus a new algorithm for solving the word problem in these groups.
Let $SB_n$ be the singular braid group generated by braid generators $σ_i$ and singular braid generators $τ_i$, $1 \leq i \leq n-1$. Let $ST_n$ denote the group that is the kernel of the homomorphism that maps, for each $i$, $σ_i$ to the cyclic permutation $(i, i+1)$ and $τ_i$ to $1$. In this paper we investigate the group $ST_3$. We obtain a presentation for $ST_3$. We prove that $ST_3$ is isomorphic to the singular pure braid group $SP_3$ on $3$ strands. We also prove that the group $ST_3$ is semi-direct product of a subgroup $H$ and an infinite cyclic group, where the subgroup $H$ is an HNN…
Let B_n be the Artin braid group on n strings with standard generators sigma_1, ..., sigma_{n-1}, and let SB_n be the singular braid monoid with generators sigma_1^{+-1}, ..., sigma_{n-1}^{+-1}, tau_1, ..., tau_{n-1}. The desingularization map is the multiplicative homomorphism eta: SB_n --> Z[B_n] defined by eta(sigma_i^{+-1}) =_i^{+-1} and eta(tau_i) = sigma_i - sigma_i^{-1}, for 1 <= i <= n-1. The purpose of the present paper is to prove Birman's conjecture, namely, that the desingularization map eta is injective.
We give presentations, in terms of generators and relations, for the monoids of singular braids on closed surfaces. The proof of the validity of these presentations can also be applied to verify, in a new way, the presentations given by Birman for the monoids of Singular Artin braids.
In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$ is the subsemigroup in $B_{n+1}$.
We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $Δ\_{ij}$, which are Garside-like half-twists involving strings $i$ through $j$, and by counting powered generators $Δ\_{ij}^k$ as $\log(|k|+1)$ instead of simply $|k|$. The geometrical complexity is some natural measure of the amount of distortion of the $n$ times punctured disk caused by a homeomorphism. Our main result is that the two notions of complexity are comparabl…
The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic representative finishes with the first generator. This proportion tends to some number $P_{n,1}$, as $k$ tends to infinity, and we show that $P_{n,1}\geq \frac{1}{8}$ for every $n\geq 1$. We also provide an explicit formula, based on the Fibonacci numbers, for the number of states of t…
We classify an action of the $n$-strand braid group on the free group of rank $n$ which is similar to the Artin representation in the sense that the $i$-th generator $σ_{i}$ of $B_{n}$ acts so that it fixes all free generators $x_{j}$ except $j = i,i+1$. We determine all such representations and discuss knot invariants coming from such representations.
We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our experimentations in the case of three and four strands and conjecture rational expressions for the spherical growth series with respect to the Birman-Ko-Lee's generators.
A toric braid is a braid whose closure is a torus link in $\mathbb{R}^3$. Manturov generalized toric braids that is called quasitoric braids and showed that the subset of quasitoric braids in the classical braid group is a subgroup of the braid group. We call this subgroup the quasitoric braid group. In this paper, we give two minimal generating sets for the quasitoric braid group and determine its abelianization. The minimalities of these two generating sets are obtained from a lower bound by the number of generators for the abelianization.
We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is homogeneous. We conjecture that monoids of homogeneous braids are Artin-Tits monoids and prove that monoids of alternating braids are right-angled Artin monoids. Using this, we give a lower bound on the growth rate of the braid groups.
In this article we prove theorem on Lifting for the set of virtual pure braid groups. This theorem says that if we know presentation of virtual pure braid group $VP_4$, then we can find presentation of $VP_n$ for arbitrary $n > 4$. Using this theorem we find the set of generators and defining relations for simplicial group $T_*$ which was defined in the previuos article of the authors. We find a decomposition of the Artin pure braid group $P_n$ in semi-direct product of free groups in the cabled generators.
The growth function is the generating function for sizes of spheres around the identity in Cayley graphs of groups. We present a novel method to calculate growth functions for automatic groups with normal form recognizing automata that recognize a single normal form for each group element, and are at most context free in complexity: context free grammars can be translated into algebraic systems of equations, whose solutions represent generating functions of their corresponding non-terminal symbols. This approach allows us to seamlessly introduce weightings on the growth function: assign differ…
For a general surface $M$ and an arbitrary braid $α$ from the surface braid group $B_{n-1}(M)$ we study the system of equations $d_1β=\cdots=d_{n}β=α, $ where operation $d_i$ is deleting of $i$-th strand. We obtain that if $M\not=S^2$ or $\mathbb RP^2$ this system of equations has a solution $β\in B_{n}(M)$ if and only if $d_1α=\ldots=d_nα. $ The set of braids satisfying the last system of equations we call Cohen braids. We also construct a set of generators for the groups of Cohen braids. In the cases of the sphere and the projective plane we give some examples for the small number of strands…
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 braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the minimal possible number of states, and we prove that its number of states is exponential in the number of strands.
Consider the ring R:=\Q[τ,τ^{-1}] of Laurent polynomials in the variable τ. The Artin's Pure Braid Groups (or Generalized Pure Braid Groups) act over R, where the action of every standard generator is the multiplication by τ. In this paper we consider the cohomology of these groups with coefficients in the module R (it is well known that such cohomology is strictly related to the untwisted integral cohomology of the Milnor fibration naturally associated to the reflection arrangement). We compute this cohomology for the cases I_2(m), H_3, H_4, F_4 and A_n with 1<n<7.
We give a complete classification of simple representations of the braid group B_3 with dimension $\leq 5$ over any algebraically closed f ield. In particular, we prove that a simple d-dimensional representation $ρ: B_3 \to GL(V)$ is determined up to isomorphism by the eigenvalues $λ_1, λ_2, ..., λ_d$ of the image of the generators for d=2,3 and a choice of a $δ=\sqrt{\det ρ(σ_1)}$ for d=4 or a choice of $δ=\sqrt[5]{\det ρ(σ_1)}$ for d=5. We also s howed that such representations exist whenever the eigenvalues and $δ$ are not roots of certain polynomials $Q_{ij}^{(d)}$, which are explicitly gi…
