arXiv Analytics

Sign in

arXiv:1802.04870 [math.GR]AbstractReferencesReviewsResources

Algorithmic problems in right-angled Artin groups: complexity and applications

Ramón Flores, Delaram Kahrobaei, Thomas Koberda

Published 2018-02-13Version 1

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography.

Comments: 16 pages
Categories: math.GR, math.AT, math.GT
Subjects: 20F36
Related articles: Most relevant | Search more
arXiv:2307.08459 [math.GR] (Published 2023-07-17)
Loose ear decompositions and their applications to right-angled Artin groups
arXiv:0805.4077 [math.GR] (Published 2008-05-27, updated 2008-08-11)
Crossed product of groups. Applications
arXiv:math/0202124 [math.GR] (Published 2002-02-13)
Functions on groups and computational complexity

Links

Toolbox