Algorithmic problems in right-angled Artin groups: complexity and applications
Group Theory
2018-11-01 v3 Algebraic Topology
Geometric Topology
Abstract
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.
Cite
@article{arxiv.1802.04870,
title = {Algorithmic problems in right-angled Artin groups: complexity and applications},
author = {Ramón Flores and Delaram Kahrobaei and Thomas Koberda},
journal= {arXiv preprint arXiv:1802.04870},
year = {2018}
}
Comments
16 pages