Decidability of the Brinkmann Problems for endomorphisms of the free group

2023/09/22 by André Carvalho, Carvalho, André, Jordi Delgado +1
Computer Science · Mathematics · #20-XX #Artificial Intelligence in Games #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2310.10668

openalex publication_date 2023/09/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that both the Brinkmann Problem (BrP) and the Brinkmann Conjugacy Problem (BrCP) are decidable for endomorphisms of the free group Fn.

Related

• On the dynamics of endomorphisms of the direct product of two free groups
• Orbit problems for free-abelian times free groups and related families
• Free-abelian by free groups: homomorphisms and algorithmic explorations
• Fixed points and stable images of endomorphisms for the free group of\n rank two
• Quantifying Brinkmann's problem: relative φ-order and φ-spectrum