Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Mathematics and Computer Science

2010

Articles 1 - 1 of 1

Full-Text Articles in Computer Sciences

Discrete Groups And The Complex Contact Geometry Of Sl(2, C), Brendan Foreman Aug 2010

Discrete Groups And The Complex Contact Geometry Of Sl(2, C), Brendan Foreman

Mathematics and Computer Science

We investigate the vertical foliation of the standard complex contact structure on Γ \ Sl(2, C), where Γ is a discrete subgroup. We find that, if Γ is nonelementary, the vertical leaves on Γ \ Sl(2, C) are holomorphic but not regular. However, if Γ is Kleinian, then Γ \ Sl(2, C) contains an open, dense set on which the vertical leaves are regular, complete and biholomorphic to C ∗. If Γ is a uniform lattice, the foliation is nowhere regular, although there are both infinitely many compact and infinitely many nonclosed leaves.