There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
We classify $\mathcal{R}$- and $\mathcal{L}$-cross-sections of wreath products of finite inverse symmetric semigroups $\mathcal{IS}_m \wr_p \mathcal{IS}_n$ up to isomorphism. We show that every isomorphism of $\mathcal{R}$ ($\mathcal{L}$-) cross-sections of $\mathcal{IS}_m \wr_p \mathcal{IS}_n$ is a conjugacy. As an auxiliary result, we get that every isomorphism of $\mathcal{R}$- ($\mathcal{L}$-) cross-sections of $\mathcal{IS}_n$ is also a conjugacy. We also compute the number of non-isomorphic $\mathcal{R}$- ($\mathcal{L}$-) cross-sections of $\mathcal{IS}_m \wr_p \mathcal{IS}_n$.
Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes. In the 1980's Thompson conjectured that the equality $N(G)=N(S)$, where $Z(G)=1$ and $S$ is simple, implies the isomorphism $G\simeq S$. In a series of papers of different authors Thompson's conjecture was proved. In this paper, we show that in some cases it is possible to omit the conditions $Z(G)=1$ and $S$ is simple and prove a more general result.
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 $GL(n,Z)$ of a matrix in $GL(n,Q)$. We do this by reducing these problems respectively to the isomorphism and automorphism group problems for certain modules over rings of the form $\mathcal O_K[y]/(y^l)$, where $\mathcal O_K$ is the maximal order of an algebraic number field and $l \in N$, and then provide algorithms to solve the latter. The algorithms are practic…
Given any connected compact orientable surface, a pair of mapping classes are said to be procongruently conjugate if they induce a conjugate pair of outer automophisms on the profinite completion of the fundamental group of the surface. For example, this occurs if they induce conjugate outer automorphisms on every characteristic finite quotient of the fundamental group. In this paper, it is shown that every procongruent conjugacy class of mapping classes, as a subset of the surface mapping class group, is the disjoint union of at most finitely many conjugacy classes of mapping classes. For any…
This is the first of two papers in which we introduce and study two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. One of these zeta functions encodes the numbers of isomorphism classes of irreducible complex representations of finite dimensions of congruence quotients of the associated group and the other one encodes the numbers of conjugacy classes of each size of such quotients. In this paper, we show that these zeta functions satisfy Euler factorizations and almost all of their Euler factors are rational and satisfy functional equati…
We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of QD-groups. (2) For every recursive function $f$, there is a QD-group $G$ containing a finitely presented subgroup $H$ whose Dehn function grows faster than $f$. (3) There exists a group with undecidable conjugacy problem but decidable power conjugacy problem; this group is QD.
We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for these subgroups. The combinatorial methods developed to achieve these results bring to light a natural map, which associates with any finitely generated subgroup of $\textsf{PSL}(2,\mathbb{Z})$ a graph which we call its silhouette, and which can be interpreted as a conjugacy class of free finite index subgroups of $\textsf{PSL}(2,\mathbb{Z})$.
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we define the Weisfeiler-Leman algorithm for groups. In fact we define three versions of the algorithm. In contrast to graphs, where the three analogous versions readily agree, for groups the situation is more intricate. For groups, we show that their expressive power is linearly related. We also give descriptions in terms of counting logics and bijective pebbl…