Ideals of equations for elements in a free group and Stallings folding
Dario Ascari

TL;DR
This paper develops algorithms based on Stallings folding to compute and analyze ideals of equations for elements in free groups, including minimal degree equations and their structural properties.
Contribution
It introduces algorithms for computing generators of the ideal of equations, finding minimal degree equations, and characterizing the degrees of equations in the ideal.
Findings
Algorithms for generating the ideal of equations using Stallings folding.
Existence of minimal degree equations and their properties.
Characterization of the set of degrees of equations in the ideal.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Algebraic Geometry and Number Theory
