Ideals of equations for elements in a free group and context-free languages

Abstract: Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of the equation is the number of occurrences of $x$ and $x<sup>{-1}$ in the cyclic reduction of $w(x)$. Given an element $g\in F$, we consider the ideal $\mathfrak{I}<em>g\subseteq H*\langle x \rangle$ of equations for $g$ with coefficients in $H$; we study the structure of $\mathfrak{I}_g$ using context-free languages. We describe a new algorithm that determines whether $\mathfrak{I}_g$ is trivial or not; the algorithm runs in polynomial time. We also describe a polynomial-time algorithm that, given $d\in\mathbb{N}$, decides whether or not the subset $\mathfrak{I}</em>{g,d}\subseteq\mathfrak{I}<em>g$ of all degree-$d$ equations is empty. We provide a polynomial-time algorithm that computes the minimum degree $d</em>{\min}$ of a non-trivial equation in $\mathfrak{I}<em>g$. We provide a sharp upper bound on $d</em>{\min}$. Finally, we study the growth of the number of (cyclically reduced) equations in $\mathfrak{I}<em>g$ and in $\mathfrak{I}</em>{g,d}$ as a function of their length. We prove that this growth is either polynomial or exponential, and we provide a polynomial-time algorithm that computes the type of growth (including the degree of the growth if it's polynomial).