Related papers: Algorithms for twisted conjugacy classes of polycy…

We give a geometric proof based on recent work of Eskin, Fisher and Whyte that the lamplighter group $L_n$ has infinitely many twisted conjugacy classes for any automorphism $\vp$ only when $n$ is divisible by 2 or 3, originally proved by…

In this second paper we solve the twisted conjugacy problem for even dihedral Artin groups, that is, groups with presentation $G(m) = \langle a,b \mid {}_{m}(a,b) = {}_{m}(b,a) \rangle$, where $m \geq 2$ is even, and $_{m}(a,b)$ is the word…

We calculate the number of the isomorphism class of the finite flat models over the ring of integers of an absolutely ramified $p$-adic field of constant group schemes of rank two over finite fields, by counting the rational points of a…

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

Let $\phi:G \to G$ be a group endomorphism where $G$ is a finitely generated group of exponential growth, and denote by $R(\phi)$ the number of twisted $\phi$-conjugacy classes. Fel'shtyn and Hill \cite{fel-hill} conjectured that if $\phi$…

We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…

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 prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…

We classify twisted conjugacy classes of type D associated to the sporadic simple groups. This is an important step in the program of the classification of finite-dimensional pointed Hopf algebras with non-abelian coradical. As a by-product…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We express the set of representations from a cyclic $p$-group to a connected $p$-compact group in terms of the associated reflection group and compute its cardinality for each exotic $p$-compact group.

We compute the $2$-completed integral motivic homology, effective algebraic K-theory, and very effective hermitian K-theory of the geometric classifying space of the cyclic group of order two over algebraically closed fields, the real…

We classify the module categories over the double (possibly twisted) of a finite group.

We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…

We formulate and prove a profinite rigidity theorem for the twisted Alexander polynomials up to several types of finite ambiguity. We also establish torsion growth formulas of the twisted homology groups in a $\mathbb{Z}$-cover of a…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

We present an algorithm that computes Bowditch's canonical JSJ decomposition of a given one-ended hyperbolic group over its virtually cyclic subgroups. The algorithm works by identifying topological features in the boundary of the group. As…

Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.