Virtually Haken surgeries on once-punctured torus bundles

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Much expanded. Added applications of the method described in v. 2. Showed that many punctured torus bundles have the property

Scientific paper

We describe a class $\mathcal{C}$ of punctured torus bundles such that, for each $M \in \mathcal{C}$, all but finitely many Dehn fillings on $M$ are virtually Haken. We show that $\mathcal{C}$ contains infinitely many commensurability classes, and we give evidence that $\mathcal{C}$ includes representatives of ``most'' commensurability classes of punctured torus bundles. In particular, we define an integer-valued complexity function on monodromies $f$ (essentially the length of the LR-factorization of $f_*$ in $PSL_2(\mathbb{Z})$), and use a computer to show that if the monodromy of $M$ has complexity at most 5, then $M$ is finitely covered by an element of $\mathcal{C}$. If the monodromy has complexity at most 12, then, with at most 36 exceptions, $M$ is finitely covered by an element of $\mathcal{C}$. We also give a method for computing ``algebraic boundary slopes'' in certain finite covers of punctured torus bundles.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Virtually Haken surgeries on once-punctured torus bundles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Virtually Haken surgeries on once-punctured torus bundles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Virtually Haken surgeries on once-punctured torus bundles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-480661

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.