Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Figelius, Michael"'
Autor:
Figelius, Michael, Lohrey, Markus
Publikováno v:
journal of Groups, complexity, cryptology, Volume 14, Issue 2 (December 26, 2022) gcc:10078
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 stud
Externí odkaz:
http://arxiv.org/abs/2202.04038
We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given expression $u_1^{k
Externí odkaz:
http://arxiv.org/abs/2002.08086
We show that the following group constructions preserve the semilinearity of the solution sets for knapsack equations (equations of the form $g_1^{x_1} \cdots g_k^{x_k} = g$ in a group $G$, where the variables $x_1, \ldots, x_k$ take values in the na
Externí odkaz:
http://arxiv.org/abs/1911.12857
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their word prob
Externí odkaz:
http://arxiv.org/abs/1909.13781
Publikováno v:
In Journal of Algebra 1 January 2022 589:437-482
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk’s group and Thompson’s groups, we prove that their word
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a844b9beb5065819aa4257a6eb4fba71