Algorithms for twisted conjugacy classes of polycyclic-by-finite groups

DOI10.1016/j.topol.2020.107565OpenAlexW3008006808MaRDI QIDQ2661717

Karel Dekimpe, Sam Tertooy

Publication date: 7 April 2021

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.08285

zbMATH Keywords

polycyclic grouptwisted conjugacycoincidence theorypolycyclic-by-finite group

Mathematics Subject Classification ID

Generalizations of solvable and nilpotent groups (20F19) Fixed points and coincidences in algebraic topology (55M20) Computational methods for problems pertaining to group theory (20-08)

Related Items (2)

Thompson-like groups, Reidemeister numbers, and fixed points ⋮ TwistedConjugacy

Uses Software

• GAP
• Polycyclic

Cites Work

• Unnamed Item
• The status of polycyclic group-based cryptography: a survey and open problems
• Algorithms for polycyclic-by-finite groups
• The finiteness of the Reidemeister number of morphisms between almost-crystallographic groups.
• The algorithmic theory of polycyclic-by-finite groups
• Infra-solvmanifolds and rigidity of subgroups in solvable linear algebraic groups
• The Reidemeister spectra of low dimensional crystallographic groups
• The Nielsen and Reidemeister numbers of maps on infra-solvmanifolds of type \((\mathrm{R})\)
• Twisted conjugacy classes in nilpotent groups
• Averaging formula for Nielsen coincidence numbers

This page was built for publication: Algorithms for twisted conjugacy classes of polycyclic-by-finite groups