Related papers: The conjugacy problem in hyperbolic groups for fin…
Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…
The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…
In this note we present an algorithm for the construction of the unit group of the Burnside ring $\Omega(G)$ of a finite group $G$ from a list of representatives of the conjugacy classes of subgroups of G.
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
We construct a hyperbolic group with a finitely presented subgroup, which has infinitely many conjugacy classes of finite-order elements. We also use a version of Morse theory with high dimensional horizontal cells and use handle…
We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.
We outline a rigorous algorithm, first suggested by Casson, for determining whether a closed orientable 3-manifold M is hyperbolic, and to compute the hyperbolic structure, if one exists. The algorithm requires that a procedure has been…
The asymptotic bound for a length-based attack on the Conjugacy Search Problem in relatively hyperbolic groups is cubic for hyperbolic elements and a "small" polynomial for parabolic elements, depending on the Conjugacy Search Problem for…
Formal languages based on the multiplication tables of finitely generated groups are investigated and used to give a linguistic characterization of word hyperbolic groups.
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
Given two conjugate mapping classes f and g, we produce a conjugating element w such that |w| < K(|f|+|g|), where |.| denotes the word metric with respect to a fixed generating set, and K is a constant depending only on the generating set.…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…
We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…
A word equation with one variable in a free group is given as $U = V$, where both $U$ and $V$ are words over the alphabet of generators of the free group and $X, X^{-1}$, for a fixed variable $X$. An element of the free group is a solution…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…