Related papers: Computing centralizers in [f.g. free]-by-cyclic gr…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

The sets of $\cB$-free integers are considered with respect to (reversing) symmetries. It is well known that, for a large class of them, the centraliser of the associated $\cB$-free shift (otherwise known as its automorphism group) is…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

A second countable virtually free pro-p group all of whose torsion elements have finite centralizer is the free pro-p product of finite p-groups and a free pro-p factor.

We prove the decidability of the elementary theory of a free group.

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

We determine all finite subgroups of simple algebraic groups that have irreducible centralizers - that is, centralizers whose connected component does not lie in a parabolic subgroup.

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…

In this paper, we classify conjugacy classes of centralizers of irreducible subgroups in $PSL(n,\mathbb{C})$ using alternate modules a.k.a. finite abelian groups with an alternate bilinear form. When $n$ is squarefree, we prove that these…

We prove a conjecture of Boston that if $p\geq 5$, all $p$-central quotients of the free group on two generators and of the free product of two cyclic groups of order $p$ are Beauville groups. In the case of the free product, we also…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

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 show that the centralizer of a nonscalar element in the coproduct $k\langle X\rangle *k[Y]$ of a free associative algebra and a polynomial algebra over a given field is commutative. For $k\langle X \rangle$ this is part of Bergman's…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

We study quasi-semisimple elements of disconnected reductive algebraic groups over an algebraically closed field. We describe their centralizers, define isolated and quasi-isolated quasi-semisimple elements and classify their conjugacy…