Orbit-blocking words in free groups

DOI10.1515/JGTH-2025-0075MaRDI QIDQ6848917zbMATH OpenFDO

Authors Lucy Koch-Hyde, Siobhan O'Connor, Éamonn Olive, Vladimir Shpilrain

Publication date 5 March 2026

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/JGTH-2025-0075

zbMATH Keywords

automorphisms of free groupsfree groupsprimitive elementsprimitivity-blocking wordsWhitehead graph

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites work

• 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?

Cited in

(1)

• Automorphic orbits in free groups: recent progress

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)