The twisted conjugacy problem for endomorphisms of polycyclic groups

DOI10.1515/JGT.2009.054zbMath1197.20027MaRDI QIDQ3565215

Vitaliĭ Roman'kov

Publication date: 2 June 2010

Published in: Journal of Group Theory (Search for Journal in Brave)

zbMATH Keywords

algorithmsendomorphismspresentationspolycyclic groupstwisted conjugacy classesfixed subgroups

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Automorphisms of infinite groups (20E36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

Twisted Burnside-Frobenius theory for endomorphisms of polycyclic groups ⋮ The status of polycyclic group-based cryptography: a survey and open problems ⋮ On generalized conjugacy and some related problems ⋮ CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM

Cites Work

• The twisted conjugacy problem for endomorphisms of metabelian groups.
• Conjugacy in polycyclic groups
• Conjugate separability in polycyclic groups
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Algorithmic problems for \(\sigma\)-power groups
• Constructions in a Polynomial Ring Over the Ring of Integers
• On the Finiteness of Certain Soluble Groups
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• Conjugacy in Nilpotent Groups
• On Infinite Soluble Groups (IV)
• Finiteness Conditions for Soluble Groups

This page was built for publication: The twisted conjugacy problem for endomorphisms of polycyclic groups