相关论文: Conjugacy problem for braid groups and Garside gro…

Knot theory is an active field of mathematics, in which combinatorial and computational methods play an important role. One side of computational knot theory, that has gained interest in recent years, both for complexity analysis and…

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…

We consider braids on $m+n$ strands, such that the first $m$ strands are trivially fixed. We denote the set of all such braids by $B_{m,n}$. Via concatenation $B_{m,n}$ acquires a group structure. The objective of this paper is to find a…

This article deals with the study of affine cactus groups from a combinatorial point of view. Those groups are extensions of cactus groups, which are related to braid and diagram groups and have gained an important place in many mathematics…

The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…

We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…

In the first part we review some topological and algebraic aspects in the theory of Artin and Coxeter groups, both in the finite and infinite case (but still, finitely generated). In the following parts, among other things, we compute the…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…

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}$…

We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

Artin groups of finite type are not as well understood as braid groups. This is due to the additional geometric properties of braid groups coming from their close connection to mapping class groups. For each Artin group of finite type, we…

We study a specific line arrangement obtained from a generic $2$-section of the braid arrangement, and compute the fundamental group of its complement via braid monodromy. We show that the resulting presentation of the fundamental group…

We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because…

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a…

We show a simple and easily implementable solution to the word problem for virtual braid groups.

We obtain an R-matrix or matrix representation of the Artin braid group acting in a canonical way on the vector space of every (super)-Lie algebra or braided-Lie algebra. The same result applies for every (super)-Hopf algebra or…