Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 432 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Kontsevich-Zorich monodromy groups of translation covers of some platonic solids (2208.08460v2)

Published 17 Aug 2022 in math.DS, math.GR, and math.GT

Abstract: We compute the Zariski closure of the Kontsevich-Zorich monodromy groups arising from certain square tiled surfaces that are geometrically motivated. Specifically we consider three surfaces that emerge as translation covers of platonic solids and quotients of infinite polyhedra, and show that the Zariski closure of the monodromy group arising from each surface is equal to a power of $\rm{SL}(2, \mathbb{R})$. We prove our results by finding generators for the monodromy groups, using a theorem of Matheus-Yoccoz-Zmiaikou that provides constraints on the Zariski closure of the groups (to obtain an "upper bound"), and analyzing the dimension of the Lie algebra of the Zariski closure of the group (to obtain a "lower bound"). Moreover, combining our analysis with the Eskin-Kontsevich-Zorich formula, we also compute the Lyapunov spectrum of the Kontsevich-Zorich cocycle for said square-tiled surfaces.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.