Related papers: Computation of Centralizers in Braid groups and Ga…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
Given a finite group $G$, let $Cent(G)$ denote the set of distinct centralizers of elements of $G$. The group $G$ is called $n$-centralizer if $|Cent(G)|=n$ and primitive $n$-centralizer if $|Cent(G)|=|Cent(\frac{G}{Z(G)})|=n$. In this…
We describe new types of normal forms for braid monoids, Artin-Tits monoids, and, more generally, for all monoids in which divisibility has some convenient lattice properties (``locally Garside monoids''). We show that, in the case of…
Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in particular are often applied to problems that fit this…
We study the centralizer of a parabolic subalgebra in the Hecke algebra associated with an arbitrary (possibly infinite) Coxeter group. While the center and cocenter have been extensively studied in the finite and affine cases, much less is…
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…
We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
In this paper, we construct an implementable algorithm which solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted…
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 $\Gamma$ be a torsion free discrete group acting cocompactly on a two dimensional euclidean building $\Delta$. The centralizer of an element of $\Gamma$ is either a Bieberbach group or is described by a finite graph of finite cyclic…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
In this paper we first show that many braid groups of low genus surfaces have their centers as direct factors. We then give a description of centralizers and normalizers of prime order elements in pure mapping class groups of surfaces with…
For every finite Coxeter group $\Gamma$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $\Gamma$, the so-called Garside-normal form.The study of the associated…
In a previous paper we investigated the centraliser dimension of groups. In the current paper we study properties of centraliser dimension for the class of free partially commutative groups and, as a corollary, we obtain an efficient…
A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…
We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…