2000 character limit reached
On Primitive Words I: A New Algorithm (1103.4061v2)
Published 21 Mar 2011 in math.GR and math.CO
Abstract: Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether a given element $w\in F_k$ is primitive, i.e. whether it belongs to some basis of $F_k$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.