Aut(F₂) puzzles
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.
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- On the classification of CAT(0) structures for the 4-string braid group.
- Random groups and nonarchimedean lattices
- Removing chambers in Bruhat-Tits buildings
- Sign and geometric meaning of curvature
- Strong Rigidity of Locally Symmetric Spaces. (AM-78)
- The 4-string braid group B₄ has property RD and exponential mesoscopic rank.
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)