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

JOURNAL OF ALGEBRA

卷:519

Article

Flores, Ramon¹  Kahrobaei, Delaram^2,3  Koberda, Thomas⁴ 

[1] Univ Seville, Dept Geometry & Topol, Seville, Spain

[2] Univ York, Dept Comp Sci, York, N Yorkshire, England

[3] NYU, CUNY, Grad Ctr, Tandon Sch Engn, New York, NY 10003 USA

[4] Univ Virginia, Math Dept, Charlottesville, VA 22903 USA

关键词: Right-angled Artin groups;    Algorithmic problems;    Autornorphism groups;    Surface groups;    Cryptography;   

DOI  :  10.1016/j.jalgebra.2018.10.023

来源: Elsevier

【 摘 要 】

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. (C) 2018 Elsevier Inc. All rights reserved.

【 授权许可】

Free