Computing centralisers in [finitely generated free]-by-cyclic groups

DOI10.1017/S0004972724000443MaRDI QIDQ6961824zbMATH OpenFDO

Authors André Carvalho

Publication date 10 July 2025

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972724000443

zbMATH Keywords

automorphismscentralisersconjugacy problemfree-by-cyclic groups

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites work

• Algebraic and context-free subsets of subgroups
• Computation of centralizers in braid groups and Garside groups.
• Detecting automorphic orbits in free groups.
• Eventually fixed points of endomorphisms of virtually free groups
• Groups with small Dehn functions and bipartite chord diagrams.
• scientific article; zbMATH DE number 1820023 (Why is no real title available?)
• scientific article; zbMATH DE number 4031953 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 67424 (Why is no real title available?)
• On a kind of Fatou property of context-free groups
• On a subclass of context-free groups
• On generalized conjugacy and some related problems
• Rational subsets of groups
• The algorithmic theory of polycyclic-by-finite groups
• THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
• The generalized conjugacy problem for virtually free groups.
• Twisted conjugacy in braid groups.

This page was built for publication: Computing centralisers in [finitely generated free]-by-cyclic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961824)