Whitehead's algorithm

Whitehead's algorithm is a mathematical procedure used primarily in the field of combinatorial group theory, particularly for the study of free groups and their automorphisms. Developed by the mathematician J.H.C. Whitehead, the algorithm provides a method for determining equivalences between different types of group presentations and analyzing their properties. The core idea of Whitehead's algorithm involves the use of a combinatorial approach to handle free groups and their corresponding relations.