Abstract
In this chapter, which is independent from the remaining chapters, we will restrict ourselves to A-adequate diagrams D(K) for which the polyhedral decomposition includes no non-prime arcs or switches. In this case, one can simplify the statement of Theorem 5.14 and give an easier combinatorial estimate for the guts of M A . This is done in Theorem 7.2, whose proof takes up the bulk of the chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note: For grayscale versions of this monograph, orange faces in the figures will appear light gray, and green ones will appear darker gray.
References
Lickorish, W.B.R., Thistlethwaite, M.B.: Some links with nontrivial polynomials and their crossing-numbers. Comment. Math. Helv. 63(4), 527–539 (1988)
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). Diagrams Without Non-prime Arcs. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-33302-6_7
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)