Related papers: Examples of centralizers in the Artin braid groups

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…

The orbifold braid groups of two dimensional orbifolds were defined in [1] (arXiv:math/9907194) to understand certain Artin groups as subgroups of some suitable orbifold braid groups. We studied orbifold braid groups in some more detail in…

We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…

In this paper we consider centralizers of single elements in Ore extensions of the ring of polynomials in one variable over a field. We show that they are commutative and finitely generated as an algebra. We also show that for certain…

We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…

We give a geometric proof that minimal length elements in a (twisted) conjugacy class of a finite Coxeter group $W$ have remarkable properties with respect to conjugation, taking powers in the associated Braid group and taking centralizer…

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Generalising previous results on classical braid groups by Artin and Lin, we determine the values of m, n $\in$ N for which there exists a surjection between the n-and m-string braid groups of an orientable surface without boundary. This…

Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first undeniable signature schemes using the conjugacy problem and the decomposition problem in the braid groups…

The purpose of this paper is to investigate the finite group which appears in the study of the Type II $\mathbf{Z}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the…

In this paper, the complete description of centralizers of elements in partially commutative Lie algebras is obtained. The description is given explicitly in the terms of generators.

In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

Cluster exchange groupoids are introduced by King-Qiu as an enhancement of cluster exchange graphs to study stability conditions and quadratic differentials. In this paper, we introduce the exchange groupoid for any finite Coxeter-Dynkin…

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…

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…

We consider the affine vertex algebra at the critical level associated with the centralizer of a nilpotent element in the Lie algebra $\mathfrak{gl}_N$. Due to a recent result of Arakawa and Premet, the center of this vertex algebra is an…