Exponent Equations in HNN-extensions

被引:1
作者
Figelius, Michael [1 ]
Lohrey, Markus [1 ]
机构
[1] Univ Siegen, Siegen, Germany
来源
PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022 | 2022年
关键词
algorithmic group theory; equations in groups; HNN-extensions; hyperbolic groups; KNAPSACK-PROBLEMS; SUBGROUPS; CLOSURE;
D O I
10.1145/3476446.3535482
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider exponent equations in finitely generated groups. These are equations, where the variables appear as exponents of group elements and take values from the natural numbers. Solvability of such (systems of) equations has been intensively studied for various classes of groups in recent years. In many cases, it turns out that the set of all solutions on an exponent equation is a semilinear set that can be constructed effectively. Such groups are called knapsack semilinear. The class of knapsack semilinear groups is quite rich and it is closed under many group theoretic constructions, e.g., finite extensions, graph products, wreath products, amalgamated free products with finite amalgamated subgroups, and HNN-extensions with finite associated subgroups. On the other hand, arbitrary HNN-extensions do not preserve knapsack semilinearity. In this paper, we consider the knapsack semilinearity of HNN-extensions, where the stable letter t acts trivially by conjugation on the associated subgroup A of the base group G. We show that under some additional technical conditions, knapsack semilinearity transfers from the base group G to the HNN-extension. These additional technical conditions are satisfied in many cases, e.g., when A is a centralizer in G or A is a quasiconvex subgroup of the hyperbolic group G.
引用
收藏
页码:293 / 301
页数:9
相关论文
共 37 条
[1]  
[Anonymous], 1949, Journal of the London Mathematical Society
[2]  
[Anonymous], 1996, Int. J. Algebra Comput., V6, P687, DOI DOI 10.1142/S0218196796000398
[3]  
Babai L, 1996, PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P498
[4]   A Characterization of Wreath Products Where Knapsack Is Decidable [J].
Bergstraesser, Pascal ;
Ganardi, Moses ;
Zetzsche, Georg .
38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
[5]  
Bier A, 2021, Arxiv, DOI arXiv:2106.11385
[6]  
Bogopolski Oleg, 2021, ARXIV
[7]  
Dudkin F., 2018, Siberian Journal of Pure and Applied Mathematics, V18, P43, DOI DOI 10.33048/PAM.2018.18.404
[8]  
Epstein D.B.A., 1992, Word Processing in Groups
[9]   The linearity of the conjugacy problem in word-hyperbolic groups [J].
Epstein, David ;
Holt, Derek .
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2006, 16 (02) :287-305
[10]  
Figelius M, 2024, Arxiv, DOI arXiv:2202.04038