Repository logo
  • English
  • Italiano
  • Log In
    Have you forgotten your password?
Repository logo
Repository logo
  • Archive
  • Series/Journals
  • EUT
  • Events
  • Statistics
  • English
  • Italiano
  • Log In
    Have you forgotten your password?
  1. Home
  2. EUT Edizioni Università di Trieste
  3. Periodici
  4. Rendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematics
  5. Rendiconti dell'Istituto di Matematica dell'Università di Trieste: an International Journal of Mathematics vol.39 (2007)
  6. On Hyperbolic $\pi-Orbifolds$ with Arbitrary many Singular Components
 
  • Details
  • Metrics
Options

On Hyperbolic $\pi-Orbifolds$ with Arbitrary many Singular Components

Vesnin, Andrei
2007
Loading...
Thumbnail Image
ISSN
0049-4704
http://hdl.handle.net/10077/4120
  • Article

Abstract
We construct a family of (n + 1)-component links $\mathcal{L}_n$ which are closures of rational 3-string braids $(\sigma_1^{-1/2}\sigma_2^2)^n$ and show that for n \geq 3 they arise as singular sets of hyperbolic $\pi-orbifolds$. Moreover, their 2-fold branched coverings are described by Dehn surgeries.
Series
Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics
39 (2007)
Subjects
  • Hyperbolic 3-Manifold...

  • Hyperelliptic Involut...

  • $\pi-Orbifolds$

Publisher
EUT Edizioni Università di Trieste
Source
Andrei Vesnin, "On Hyperbolic $\pi-Orbifolds$ with Arbitrary many Singular Components”, in: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics, 39 (2007), pp. 375–386.
Languages
en
File(s)
Loading...
Thumbnail Image
Download
Name

VesninRendMat39.pdf

Format

Adobe PDF

Size

289.03 KB

Indexed by

 Info

Open Access Policy

Share/Save

 Contacts

EUT Edizioni Università di Trieste

OpenstarTs

 Link

Wiki OpenAcces

Archivio Ricerca ArTS

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback