On the complexity of orbit word problems

DOI10.1016/J.JCO.2025.101929MaRDI QIDQ7006217zbMATH OpenFDO

Authors Michael Maller

Publication date 31 March 2025

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCO.2025.101929

zbMATH Keywords

computational complexityfitted diffeomorphismsshadowing lemma

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Symbolic dynamics (37B10) Approximate trajectories, pseudotrajectories, shadowing and related notions for topological dynamical systems (37B65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• Fitted diffeomorphisms of non-simply connected manifolds
• Homology theory and dynamical systems
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• On a Theorem of P. Hartman
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the complexity of Anosov saddle transitions
• On the complexity of fitted toral dynamics
• On the size of the domain of linearization in Hartman's theorem
• Structurally stable diffeomorphisms are dense
• The existence of Morse-Smale diffeomorphisms

This page was built for publication: On the complexity of orbit word problems

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