Orbit decidability, applications and variations

2013/05/10 by Ventura, Enric
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1305.2294

Abstract

We present the notion of orbit decidability into a more general framework, exploring interesting generalizations and variations of this algorithmic problem. A recent theorem by Bogopolski-Martino-Ventura gave a renovated protagonism to this notion and motivated several interesting algebraic applications.

Related

• Orbit Problem Revisited
• On the Complexity of the Orbit Problem
• The Semialgebraic Orbit Problem
• Undecidability of Finite Orbit Recognition in Polynomial Maps
• Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem