A simple solution to the word problem for virtual braid groups
Paolo Bellingeri (LMNO), Bruno Aaron Cisneros de La Cruz (IMB), Luis, Paris (IMB)
TL;DR
This paper presents a straightforward and practical method to solve the word problem in virtual braid groups, facilitating easier computation and understanding of these algebraic structures.
Contribution
It introduces a simple, implementable solution to the word problem for virtual braid groups, advancing computational approaches in this area.
Findings
Provided an easily implementable solution
Simplified the process for solving the word problem
Enhanced computational efficiency for virtual braid groups
Abstract
We show a simple and easily implementable solution to the word problem for virtual braid groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Homotopy and Cohomology in Algebraic Topology