Related papers: On generalized conjugacy and some related problems

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

Let $G$ be a residually finite, good group of finite virtual cohomological dimension. We prove that the natural monomorphism $G\hookrightarrow\hat{G}$ induces a bijective correspondence between conjugacy classes of finite $p$-subgroups of…

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…

The general position number ${\rm gp}(G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on a common geodesic. It is proved that ${\rm gp}(G)\ge…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing the element $x$. A famous theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the derived group…

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

Let H and K be quasiconvex subgroups of a negatively curved torsion-free group G. We give an algorithm which decides whether an element of H is conjugated in G to an element of K.

We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism $\varphi$, an element $x\in G$ and a subset $K\subseteq G$, we say that the relative $\varphi$-order of $g$ in $K$,…

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.

In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.

Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…

We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…

Let $G$ be the generalized free product of two groups with an amalgamated subgroup. We propose an approach that allows one to use results on the residual $p$-finiteness of $G$ for proving that this generalized free product is residually a…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

A complete mapping of a group $G$ is a bijection $\phi\colon G\to G$ such that $x\mapsto x\phi(x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a complete mapping whenever $\prod_{x\in G} x$ is the…