Ideals of equations for elements in a free group and Stallings folding
From MaRDI portal
Publication:6404590
arXiv2207.04759MaRDI QIDQ6404590FDOQ6404590
Authors: Dario Ascari
Publication date: 11 July 2022
Abstract: Let be a finitely generated free group and let be a finitely generated subgroup. Given an element , we study the ideal of equations for with coefficients in , i.e. the elements such that in . The ideal is a normal subgroup of , and we provide an algorithm, based on Stallings folding operations, to compute a finite set of generators for as a normal subgroup. We provide an algorithm to find an equation in with minimum degree, i.e. an equation such that its cyclic reduction contains the minimum possible number of occurrences of and ; this answers a question of A. Rosenmann and E. Ventura. More generally, we provide an algorithm that, given , determines whether contains equations of degree or not, and we give a characterization of the set of all the equations of that specific degree. We define the set of all integers such that contains equations of degree ; we show that coincides, up to a finite set, either with the set of non-negative even numbers or with the set of natural numbers. Finally, we provide examples to illustrate the techniques introduces in this paper. We discuss the case where . We prove that both kinds of sets can actually occur. The examples also show that the equations of minimum possible degree aren't in general enough to generate the whole ideal as a normal subgroup.
Free nonabelian groups (20E05) Geometric group theory (20F65) Algebraic geometry over groups; equations over groups (20F70)
This page was built for publication: Ideals of equations for elements in a free group and Stallings folding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404590)