English
Related papers

Related papers: Reidemeister classes, wreath products and solvabil…

200 papers

Let $G$ be a group and $\varphi$ an automorphism of $G$. Two elements $x,y \in G$ are said to be $\varphi$-conjugate if there exists a third element $z \in G$ such that $z x \varphi(z)^{-1} = y$. Being $\varphi$-conjugate defines an…

Group Theory · Mathematics 2024-02-26 Maarten Lathouwers , Thomas Witdouck

We study the product formula for Reidemeister numbers on finitely generated torsion-free nilpotent groups in two ways. On the one hand, we generalise the product formula to central extensions. On the other hand, we derive general results…

Group Theory · Mathematics 2025-02-25 Pieter Senden

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

K-Theory and Homology · Mathematics 2011-03-03 S. K. Roushon

We study groups $G$ where the $\varphi$-conjugacy class $[e]_{\varphi}=\{g^{-1}\varphi(g)~|~g\in G\}$ of the unit element is a subgroup of $G$ for every automorphism $\varphi$ of $G$. If $G$ has $n$ generators, then we prove that the $k$-th…

Group Theory · Mathematics 2017-05-22 Daciberg Gonçalves , Timur Nasybullov

Given a group $G$ and an automorphism $\varphi$ of $G$, two elements $x,y\in G$ are said to be $\varphi$-conjugate if $x=gy\varphi(g)^{-1}$ for some $g\in G$. The number $R(\varphi)$ of equivalence classes with respect to this relation is…

Group Theory · Mathematics 2026-01-14 Marius Tărnăuceanu

For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…

Group Theory · Mathematics 2007-05-23 Alexander Fel'shtyn , Evgenij Troitsky

We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…

Operator Algebras · Mathematics 2023-06-06 Ionut Chifan , Adrian Ioana , Denis Osin , Bin Sun

Let G be a group and {\phi} be an automorphism of G. Two elements x, y of G are said to be {\phi}-twisted if y = gx{\phi}(g)^{-1} for some g in G. We say that a group G has the R_{\infty}-property if the number of {\phi}-twisted conjugacy…

Group Theory · Mathematics 2025-10-06 Sushil Bhunia , Pinka Dey , Amit Roy

A group is said to have the $R_\infty$ property if every automorphism has an infinite number of twisted conjugacy classes. We study the question whether $G$ has the $R_\infty$ property when $G$ is a finitely generated torsion-free nilpotent…

Group Theory · Mathematics 2011-05-11 Daciberg Gonçalves , Peter Wong

It is proved for Abelian groups that the Reidemeister coincidence number of two endomorphisms $\phi$ and $\psi$ is equal to the number of coincidence points of $\wh\phi$ and $\wh\psi$ on the unitary dual, if the Reidemeister number is…

Group Theory · Mathematics 2008-10-23 Alexander Fel'shtyn

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

Group Theory · Mathematics 2011-04-22 Eloisa Detomi , Andrea Lucchini

Wreath products such as Z wr Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z wr Z as a subgroup of Thompson's group F and as a subgroup of Baumslag's metabelian…

Group Theory · Mathematics 2018-03-19 Sean Cleary

Let $G$ be a group and $\varphi$ be an automorphism of $G$. Two elements $x, y$ of $G$ are said to be $\varphi$-twisted conjugate if $y=gx\varphi(g)^{-1}$ for some $g\in G$. A group $G$ has the $R_{\infty}$-property if the number of…

Group Theory · Mathematics 2022-12-12 Sushil Bhunia , Swathi Krishna

In this paper we study the number of twisted conjugacy classes (the Reidemeister number) for automorphisms of crystallographic groups. We present two main algorithms for crystallographic groups whose holonomy group has finite normaliser in…

Group Theory · Mathematics 2021-10-22 Karel Dekimpe , Tom Kaiser , Sam Tertooy

Let $G$ be a non-compact semisimple Lie group with finite centre and finitely many components. We show that any finitely generated group $\Gamma$ which is quasi-isometric to an irreducible lattice in $G$ has the $R_\infty$-property, namely,…

Group Theory · Mathematics 2018-01-09 T. Mubeena , P. Sankaran

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…

Group Theory · Mathematics 2009-10-20 V. Roman'kov , E. Ventura

In [F. Caselli, Involutory reflection groups and their models, J. Algebra 24 (2010), 370--393] it is constructed a uniform Gelfand model for all non-exceptional irreducible complex reflection groups which are involutory. This model can be…

Combinatorics · Mathematics 2010-07-19 Fabrizio Caselli , Roberta Fulci

The Reidemeister number of an endomorphism of a group is the number of twisted conjugacy classes determined by that endomorphism. The collection of all Reidemeister numbers of all automorphisms of a group $G$ is called the Reidemeister…

Group Theory · Mathematics 2021-10-22 Karel Dekimpe , Sam Tertooy , Iris Van den Bussche

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products,…

Formal Languages and Automata Theory · Computer Science 2016-01-07 Liang-Ting Chen , Jiri Adamek , Stefan Milius , Henning Urbat

We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$…

Computational Complexity · Computer Science 2017-09-12 Alexei Miasnikov , Svetla Vassileva , Armin Weiß