Related papers: On the conjugacy problem for cyclic extensions of …

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…

In this paper, we construct an implementable algorithm which solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted…

Using the canonical JSJ splitting, we describe the outer automorphism group $\Out(G)$ of a one-ended word hyperbolic group $G$. In particular, we discuss to what extent $\Out(G)$ is virtually a direct product of mapping class groups and a…

We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.

In 1971 C.F.\ Miller associated to every finitely presented group $G$ a free-by-free group $M(G)$ known as the Miller Machine, whose conjugacy problem is closely related to the conjugacy and word problems of $G$. We quantify this…

We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…

We show that the twisted conjugacy problem is solvable for large-type Artin groups whose outer automorphism group is finite, generated by graph automorphisms and the global inversion. This includes XXXL Artin groups whose defining graph is…

We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.

A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…

Solvability of the conjugacy problem for relatively hyperbolic groups was announced by Gromov [Hyperbolic groups, MSRI publications 8 (1987)]. Using the definition of Farb of a relatively hyperbolic group in the strong sense [B Farb,…

We obtain a homological characterisation of virtually free-by-cyclic groups among groups that are hyperbolic and virtually compact special. As a consequence, we show that many groups known to be coherent actually possess the stronger…

We study the representation growth of alternating and symmetric groups in positive characteristic and restricted representation growth for the finite groups of Lie type. We show that the the number of representations of dimension at most n…

It is proven in the paper, that Carter subgroups of a finite group are conjugate if Carter subgroups in the group of induced automorphisms for every non-Abelian composition factor are conjugate.

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 prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…