Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the complexity of non-orientable Seifert fibre spaces

Published 21 Apr 2017 in math.GT | (1704.06721v4)

Abstract: In this paper we deal with Seifert fibre spaces, which are compact 3-manifolds admitting a foliation by circles. We give a combinatorial description for these manifolds in all the possible cases: orientable, non-orientable, closed, with boundary. Moreover, we compute a potentially sharp upper bound for their complexity in terms of the invariants of the combinatorial description, extending to the non-orientable case results by Fominykh and Wiest for the orientable case with boundary and by Martelli and Petronio for the closed orientable case.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Collections

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