EXPONENT EQUATIONS IN HNN-EXTENSIONS

被引:0
作者
Figelius, Michael [1 ]
Lohrey, Markus [1 ]
机构
[1] Univ Siegen, Dept Elect Engn & Comp Sci, Siegen, Germany
关键词
HNN-extensions; hyperbolic groups; knapsack problems; exponent equations; KNAPSACK-PROBLEMS; SUBGROUPS; CLOSURE;
D O I
10.46298/jgcc.2022.14.2.10521
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. Examples of knapsack semilinear groups are hyperbolic groups, virtually special groups, co-context-free groups and free solvable groups. Moreover, knapsack semilinearity is preserved by 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 base group G to the HNN-extension H. 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.
引用
收藏
页码:1 / 25
页数:25
相关论文
共 39 条
[1]  
[Anonymous], 1949, Journal of the London Mathematical Society
[2]  
[Anonymous], 1996, Int. J. Algebra Comput., V6, P687, DOI DOI 10.1142/S0218196796000398
[3]   On quasiconvex subgroups of word hyperbolic groups [J].
Arzhantseva, GN .
GEOMETRIAE DEDICATA, 2001, 87 (1-3) :191-208
[4]  
Babai L, 1996, PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P498
[5]   On the Descriptional Complexity of Operations on Semilinear Sets [J].
Beier, Simon ;
Holzer, Markus ;
Kutrib, Martin .
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (252) :41-55
[6]  
Bergsträsser P, 2021, Arxiv, DOI arXiv:2101.06132
[7]   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
[8]  
Bier A, 2021, Arxiv, DOI arXiv:2106.11385
[9]   Decidability problem for exponential equations in finitely presented groups [J].
Bogopolski, Oleg ;
Ivanov, Aleksander .
CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2023, 66 (03) :731-748
[10]  
Dudkin F., 2018, Siberian Journal of Pure and Applied Mathematics, V18, P43, DOI DOI 10.33048/PAM.2018.18.404