A Pansiot-type subword complexity theorem for automorphisms of free groups
From MaRDI portal
(Redirected from Publication:6406616)
A Pansiot-type subword complexity theorem for automorphisms of free groups (scientific article; zbMATH DE number 900542031)
A Pansiot-type subword complexity theorem for automorphisms of free groups (scientific article; zbMATH DE number 900542031)
Abstract: Inspired by Pansiot's work on substitutions, we prove a similar theorem for automorphisms of a free group F of finite rank: if a right-infinite word represents an attracting fixed point of an automorphism of F, the subword complexity of X is equivalent to n, n log log n, n log n, or n^2. The proof uses combinatorial arguments analogue to Pansiot's as well as train tracks. We also define the recurrence complexity of X, and we apply it to laminations. In particular, we show that attracting laminations have complexity equivalent to n, n log log n, n log n, or n^2 (to n if the automorphism is fully irreducible).
This page was built for publication: A Pansiot-type subword complexity theorem for automorphisms of free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406616)
