Aut(F₂) puzzles

From MaRDI portal
Publication:1736082



Abstract: This paper studies Aut(F2) and groups closely related to it from a geometric perspective.


A ring puzzle is a tessellation of the Euclidean plane $\mathbb{R}^2$ using planar polygons with coloured angles. The ring at a vertex of the puzzle is the coloured circle of small radius around that vertex. A ring puzzle problem is the problem of classifying all puzzles whose coloured polygons and rings belong to prescribed sets. \par The authors consider one concrete ring puzzle problem with two admissible poligons (an equilateral triangle and a lozenge) and three admissible rings. It is stated that this problem is connected with $\operatorname{Aut}(F_2)$ group. \par The main result states that there are 4 infinite families of considered puzzles and 9 exceptional puzzles belonging to the families.











This page was built for publication: \(\operatorname{Aut}(F_2)\) puzzles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736082)