Abstract
Theorem 5.14 reduces the problem of computing the Euler characteristic of the guts of M A to counting how many complex EPDs are required to span the I-bundle of the upper polyhedron. Our purpose in this chapter is to recognize such EPDs from the structure of the all-A state graph \({\mathbb{G}}_{A}\). The main result is Theorem 6.4, which describes the basic building blocks for such EPDs.
Keywords
- Euler Characteristic
- Basic Building Block
- Downstream Direction
- State Circle
- Jones Polynomial
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptions








Notes
- 1.
Note: For grayscale versions of this chapter, the figures will show green faces as darker gray, orange faces as lighter gray.
- 2.
In grayscale versions of this monograph, green will appear darker gray, orange lighter gray.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Futer, D., Kalfagianni, E., Purcell, J. (2013). Recognizing Essential Product Disks. In: Guts of Surfaces and the Colored Jones Polynomial. Lecture Notes in Mathematics, vol 2069. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33302-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-33302-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33301-9
Online ISBN: 978-3-642-33302-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
