Dehn's Algorithm for Simple Diagrams
Charles Frohman, Joanna Kania-Bartoszynska

TL;DR
This paper presents a version of Dehn's algorithm tailored for simple diagrams on a once punctured surface, enabling the representation of simple diagrams on a closed surface.
Contribution
It introduces a novel adaptation of Dehn's algorithm for simple diagrams on punctured surfaces, bridging the gap to closed surface representations.
Findings
Algorithm effectively identifies simple diagrams on punctured surfaces.
Enables translation of simple diagrams to closed surfaces.
Provides a computational tool for surface topology analysis.
Abstract
A version of Dehn's algorithm for simple diagrams on a once punctured surface representing simple diagrams on a closed surface is presented
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.
