Orbit-blocking words in free groups
This paper studies orbit-blocking words in the free group \(F_r\). For \(w\in F_r\), a word \(v\) is called \(w\)-orbit-blocking if \(v\) is not a subword of the cyclic reduction of \(\varphi(w)\) for any automorphism \(\varphi\in \operatorname{Aut}(F_r)\). This extends the notion of a primitivity-blocking word, corresponding to the case \(w=x_1\).\N\NThe starting point is the cut vertex lemma by \textit{J. H. C. Whitehead} [Proc. London math. Soc. 41, 48--56 (1936; Zbl 0013.24801)]: the Whitehead graph of a cyclically reduced primitive element is either disconnected or has a cut vertex. The paper briefly recalls this classical criterion and also refers to a recent extension to primitive elements in subgroups of \(F_r\) (see [\textit{D. Ascari}, Groups Geom. Dyn. 18, No. 1, 235--264 (2024; Zbl 1540.20046)]). Building on this background, the authors prove that primitivity-blocking words cannot occur as subwords in several wider situations, including strongly reduced bases and derive corresponding generalizations for weakly reduced and partially reduced bases, as well as for images of slender words under strongly reduced automorphisms.\N\NThe main result shows that for every \(w\in F_r\) there exist \(w\)-orbit-blocking words. More precisely, if the cyclically reduced length of \(w\) is \(\ell\) and \(v_1,\dots,v_{\ell+1}\) is a sequence of primitivity-blocking words with no cancellation between consecutive terms and none between \(v_{\ell+1}\) and \(v_1\), then \(\prod_{i=1}^{\ell+1} v_i\) is \(w\)-orbit-blocking. The paper also gives new examples of primitivity-blocking words, proves the existence of an \(O(n^2)\) algorithm deciding primitivity-blocking in \(F_2\) and applies the orbit-blocking construction to a variant of Whitehead's problem, obtaining constant average-case time complexity for cyclically reduced random inputs of length \(n\).
- A fine property of Whitehead's algorithm
- A remark on Whitehead's cut-vertex lemma
- Automorphic orbits in free groups.
- Average-case complexity and decision problems in group theory.
- Average-case complexity of the Whitehead problem for free groups
- Fast Pattern Matching in Strings
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Growth and ergodicity of context-free languages
- scientific article; zbMATH DE number 2144699 (Why is no real title available?)
- scientific article; zbMATH DE number 1421182 (Why is no real title available?)
- On certain sets of elements in a free group.
- On equivalent sets of elements in a free group
- On the palindromic and primitive widths of a free group.
- Orbit-blocking words and the average-case complexity of Whitehead's problem in the free group of rank 2
- What does a basis of F(a,b) look like?
This page was built for publication: Orbit-blocking words in free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848917)