hexagonal mosaic knots
play

Hexagonal Mosaic Knots Malachi Alexander, Selina Foster, and Gianni - PowerPoint PPT Presentation

Introduction Hextile Number Conclusion Hexagonal Mosaic Knots Malachi Alexander, Selina Foster, and Gianni Krakoff Mentored by Dr. Jennifer McLoud-Mann University of Washington Bothell Research Experience for Undergraduates August 28, 2017


  1. Introduction Hextile Number Conclusion Hexagonal Mosaic Knots Malachi Alexander, Selina Foster, and Gianni Krakoff Mentored by Dr. Jennifer McLoud-Mann University of Washington Bothell Research Experience for Undergraduates August 28, 2017

  2. Introduction Hextile Number Conclusion Definition of a Knot Definition A knot is an embedding of a circle in three-dimensional space.

  3. Introduction Hextile Number Conclusion Definition of a Knot Definition A knot is an embedding of a circle in three-dimensional space.

  4. Introduction Hextile Number Conclusion Definition of a Knot Definition A knot is an embedding of a circle in three-dimensional space.

  5. Introduction Hextile Number Conclusion Definition of a Knot Definition A knot is an embedding of a circle in three-dimensional space.

  6. Introduction Hextile Number Conclusion Common Terminology Knot Unknot Link Crossing Undercrossing Overcrossing

  7. Introduction Hextile Number Conclusion Equivalence of Knots

  8. Introduction Hextile Number Conclusion Equivalence of Knots

  9. Introduction Hextile Number Conclusion What is a Mosaic Knot?

  10. Introduction Hextile Number Conclusion What is a Mosaic Knot?

  11. Introduction Hextile Number Conclusion Defining the Hextile A hextile must obey the following axioms: A curve must terminate at the midpoint of an edge and a curve cannot cross itself. Two curves cannot cross more than once and cannot share an edge. Examples of Violations

  12. Introduction Hextile Number Conclusion Types of Hextiles Type 0 Type 1 Type 2 Type 3 Type 4 Type 5 Type 6 Type 7 Type 8 Type 9 Type 10 Type 11 Type 12 Type 13 Type 14 Type 15 Type 16 Type 17 Type 18 Type 19 Type 20 Type 21 Type 22 Type 23

  13. Introduction Hextile Number Conclusion Arrangements and Diagrams Arrangement of ten hextiles. Arrangement of ten hextiles.

  14. Introduction Hextile Number Conclusion Arrangements and Diagrams Not suitably connected. Arrangement of ten hextiles.

  15. Introduction Hextile Number Conclusion Arrangements and Diagrams Not suitably connected. Suitably connected.

  16. Introduction Hextile Number Conclusion Reidemeister Moves & Planar Isotopy Reidemeister Move I Reidemeister Move II Reidemeister Move III Planar Isotopy

  17. Introduction Hextile Number Conclusion The Hextile Number Definition The hextile number of a link L is the least number of hextiles needed to represent L , denoted h ( L ) . More crossings per tile does not imply hextile number.

  18. Introduction Hextile Number Conclusion Hextile Number as a Knot Invariant Definition The hextile number of a link L is the least number of hextiles needed to represent L , denoted h ( L ) . Theorem The hextile number is knot invariant. Proof. Similar to the crossing number, given two knots if the hextile numbers are different then the knots must be different, and if the hextile numbers are the same then we can’t conclude the knots are different.

  19. Introduction Hextile Number Conclusion Theorems About Hextile Number Theorem For a non-trivial link L, h ( L ) � 6 . h (2 2 1 ) = 6 and h (3 1 ) = 6.

  20. Introduction Hextile Number Conclusion Proof Concept: Pincer Movement Construction To show that we actually have in our hands the hextile number for some knot, our main technique has been squeezing the upper and lower bounds. We want to show that h (3 1 ) = 6; it is sufficient to show that h (3 1 ) > 5, and that 7 > h (3 1 ). We already have it on 6. Computations become exponentially harder as the number of hextiles increases.

  21. Introduction Hextile Number Conclusion Theorems About Hextile Number and Crossing Number Theorem For a link L, if c ( L ) � 4 , then h ( L ) � 8 . Theorem For a knot K, if c ( K ) � 5 , then h ( K ) � 9 .

  22. Introduction Hextile Number Conclusion Known and Unknown Hextile Numbers h ( L ) h ( L ) L L 0 1 3 6 1 9 0 2 5 6 2 9 1 2 2 6 6 3 9 1 3 1 6 7 1 12? 4 1 8 7 2 13? 4 2 8 7 3 14? 1 5 2 8 7 4 11? 1 5 1 9 7 5 11? 5 2 9 7 6 10? 3 1 #3 1 9 7 7 9 Is this D (7 3 ) reducible?

  23. Introduction Hextile Number Conclusion Thank You! I would like to thank: My research mentor, Dr. Jennifer McLoud-Mann My faculty mentor, Dr. Alison Lynch The National Science Foundation Grant DMS1460699 Undergraduate Research Opportunities Center

  24. Introduction Hextile Number Conclusion References [1] Adams, C. The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots . Berlin; New York: American Mathematical Society, 2004. [2] Gallian, J. A. Contemporary Abstract Algebra . Houghton Mifflin, Boston, New York, 2006. [3] Howards, H., and Kobin, A. Crossing number bound in knot mosaics. arXiv:1405.7683 (2014). [4] Lomonaco, S. J., and Kauffman, L. H. Quantum knots and mosaics. Quantum Information Processing 7 , 2-3 (2008), 85–115. [5] Ludwig, L. D., Evans, E. L., and Paat, J. S. An infinite family of knots whose mosaic number is realized in non-reduced projections. Journal of Knot Theory and Its Ramifications 22 , 07 (2013), 1350036.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend