A New Algorithm for Computing the Veech Group of a Translation Surface Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/0v838415s

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We give a new characterization of elements in the Veech group of a translation surface. This provides a computational test for Veech group membership. We use this computational test in an algorithm that detects when the Veech group is a lattice (has co-finite area), and in this case computes a fundamental polygon for the action of the Veech group on the hyperbolic plane. A standard result, essentially due to Poincaré, provides that a complete set of generators for the Veech group can then be obtained from the side pairings associated to this fundamental polygon. Our approach introduces a new computational framework used to formulate a membership criterion for the Veech group of a compact translation surface (X,ω). We represent (X,ω) on a certain non-compact translation surface O that can be used to represent any translation surface within the SL(2,ℝ) orbit of the translation equivalence class of (X,ω). The surface O has an easily computed SL(2,ℝ)-action. When this action is restricted to the translation surface representations mentioned above, it corresponds to the usual SL(2,ℝ)-action on the set of equivalence classes of translation surfaces. The Veech group of a compact translation surface is therefore the stabilizer of its representation on O.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Brandon Edwards (edwardbr@oregonstate.edu) on 2017-04-13T13:41:56Z No. of bitstreams: 1 EdwardsBrandonG2017.pdf: 1238884 bytes, checksum: 89e28400e6cea8671b680bf5d32439e4 (MD5)
  • description.provenance : Made available in DSpace on 2017-04-13T20:34:23Z (GMT). No. of bitstreams: 1 EdwardsBrandonG2017.pdf: 1238884 bytes, checksum: 89e28400e6cea8671b680bf5d32439e4 (MD5) Previous issue date: 2017-03-17
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2017-04-13T20:34:23Z (GMT) No. of bitstreams: 1 EdwardsBrandonG2017.pdf: 1238884 bytes, checksum: 89e28400e6cea8671b680bf5d32439e4 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2017-04-13T17:19:40Z (GMT) No. of bitstreams: 1 EdwardsBrandonG2017.pdf: 1238884 bytes, checksum: 89e28400e6cea8671b680bf5d32439e4 (MD5)

Relationships

In Administrative Set:
Last modified: 08/22/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items