Describing elements of the genus-2 Goeritz group of $S^3$
Sreekrishna Palaparthi, Swapnendu Panda

TL;DR
This paper provides a finite generating set for the genus-2 Goeritz group of the 3-sphere, along with an algorithm to uniquely express its elements as words in this set, based on Dehn twists and a complexity measure.
Contribution
It introduces a finite generating set for the genus-2 Goeritz group of S^3 and an algorithm for unique word representation of its elements.
Findings
Finite generating set G_2 for the genus-2 Goeritz group of S^3.
An algorithm to express elements as words in G_2.
Uniqueness of the word description based on a complexity measure.
Abstract
In this article we present a finite generating set of , the genus-2 Goeritz group of , in terms of Dehn twists about certain simple closed curves on the standard Heegaard surface. We present an algorithm that describes an element as a word in the alphabet of in a certain format. Using a complexity measure defined on reducing spheres, we show that such a description of is unique.
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 · Advanced Combinatorial Mathematics · semigroups and automata theory
