Zobrazeno 1 - 4
of 4
pro vyhledávání: '"20F65, 68Q15"'
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is decidable
Externí odkaz:
http://arxiv.org/abs/2110.00900
Autor:
Elder, Murray, Kalka, Arkadius
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace computable. For li
Externí odkaz:
http://arxiv.org/abs/1310.0933
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also certain f
Externí odkaz:
http://arxiv.org/abs/1201.4363
Publikováno v:
Journal of Algebra. 381:260-281
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also certain f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::027de14b05088b67505cb60e6e18a966
https://doi.org/10.1016/j.jalgebra.2013.01.036
https://doi.org/10.1016/j.jalgebra.2013.01.036
