2016
DOI: 10.2140/pjm.2016.283.271
|View full text |Cite
|
Sign up to set email alerts
|

A simple solution to the word problem for virtual braid groups

Abstract: International audienceWe show a simple and easily implementable solution to the word problem for virtual braid groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 13 publications
0
10
0
Order By: Relevance
“…It is denoted by KB n . It is an Artin group, hence we can use tools from the theory of Artin groups to study it and get results on VB n itself (see for example Godelle-Paris [14] or Bellingeri-Cisneros de la Cruz-Paris [8]). This group will play a prominent role in our study.…”
Section: τ N−1 and Relationsmentioning
confidence: 99%
See 3 more Smart Citations
“…It is denoted by KB n . It is an Artin group, hence we can use tools from the theory of Artin groups to study it and get results on VB n itself (see for example Godelle-Paris [14] or Bellingeri-Cisneros de la Cruz-Paris [8]). This group will play a prominent role in our study.…”
Section: τ N−1 and Relationsmentioning
confidence: 99%
“…Despite their interest in low-dimensional topology, the virtual braid groups are poorly understood from a combinatorial point of view. Among the known results for these groups there are solutions to the word problem in Bellingeri-Cisneros de la Cruz-Paris [8] and in Chterental [10] and the calculation of some terms of its lower central series in , and some other results but not many more. For example, it is not known whether these groups have a solution to the conjugacy problem or whether they are linear.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…In particular KVB n is also of type F, therefore it is torsion free and it has a solution to the word problem. Since KVB n is of finite index in VB n , we can therefore use KVB n to solve the word problem in VB n (see Bellingeri-Cisneros-de-la-Cruz-Paris [5]).…”
Section: Introductionmentioning
confidence: 99%