unknotted cycles
play

Unknotted Cycles Nathan McNew Towson University Joint with - PowerPoint PPT Presentation

Apr 12, 2023 •191 likes •1.52k views

Unknotted Cycles Nathan McNew Towson University Joint with Christopher Cornwell Permutation Patterns 2018 Dartmouth College Hanover, NH July 13th, 2018 Nathan McNew Unknotted Cycles July 13th, 2018 1 Cycle Diagrams The cycle diagram of a

  1. Observation Grid diagrams are remarkably similar to cycle diagrams. Treating diagonal entries of a cycle diagram as points the only differences are: In cycle diagrams one of the two points in each row/column must lie on the diagonal, which isn’t the case for grid diagrams. In grid diagrams, it is not allowed to have a single point in a row or column as occur in cycle diagrams when there are fixed points. Restricting our attention to derangements , permutations without fixed points, every cycle diagram can be interpreted as a grid diagram, associating a link (knot) to each derangement (cycle). Nathan McNew Unknotted Cycles July 13th, 2018 6

  2. The link associated to a permutation Definition For any derangement σ , the link associated to σ is obtained by drawing the cycle diagram of σ and interpreting it as a grid diagram instead. If σ is a cycle then this is the knot associated to σ . Nathan McNew Unknotted Cycles July 13th, 2018 7

  3. The link associated to a permutation Definition For any derangement σ , the link associated to σ is obtained by drawing the cycle diagram of σ and interpreting it as a grid diagram instead. If σ is a cycle then this is the knot associated to σ . We will call any cycle associated to the unknot an unknotted cycle . Nathan McNew Unknotted Cycles July 13th, 2018 7

  4. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  5. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  6. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  7. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  8. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  9. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  10. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  11. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  12. Example: σ = 837295641 Nathan McNew Unknotted Cycles July 13th, 2018 8

  13. Example: σ = 837295641 ... the unknot! Nathan McNew Unknotted Cycles July 13th, 2018 8

  14. Example: σ = 57428163 Nathan McNew Unknotted Cycles July 13th, 2018 9

  15. Example: σ = 57428163 Nathan McNew Unknotted Cycles July 13th, 2018 9

  16. Example: σ = 57428163 Nathan McNew Unknotted Cycles July 13th, 2018 9

  17. Example: σ = 57428163 Nathan McNew Unknotted Cycles July 13th, 2018 9

  18. Example: σ = 57428163 Nathan McNew Unknotted Cycles July 13th, 2018 9

  19. Example: σ = 57428163 ... a trefoil knot. Nathan McNew Unknotted Cycles July 13th, 2018 9

  20. Counting Unknotted Cycles How many cycles of length n are unknotted? Nathan McNew Unknotted Cycles July 13th, 2018 10

  21. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles Nathan McNew Unknotted Cycles July 13th, 2018 10

  22. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles 2 1 Nathan McNew Unknotted Cycles July 13th, 2018 10

  23. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles 2 1 3 2 Nathan McNew Unknotted Cycles July 13th, 2018 10

  24. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles 2 1 3 2 4 6 Nathan McNew Unknotted Cycles July 13th, 2018 10

  25. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles 2 1 3 2 4 6 5 22 · · · Nathan McNew Unknotted Cycles July 13th, 2018 10

  26. Counting Unknotted Cycles How many cycles of length n are unknotted? n # cycles 2 1 3 2 4 6 5 22 · · · 6 90 · · · Nathan McNew Unknotted Cycles July 13th, 2018 10

  27. Counting Unknotted Cycles Nathan McNew Unknotted Cycles July 13th, 2018 11

  28. Counting Unknotted Cycles Denote by S n the n th large Schr¨ oder number, given by the recurrence S 1 = 1 and n − 1 � S n = S n − 1 + S k S n − k . k =1 Nathan McNew Unknotted Cycles July 13th, 2018 11

  29. Counting Unknotted Cycles Denote by S n the n th large Schr¨ oder number, given by the recurrence S 1 = 1 and n − 1 � S n = S n − 1 + S k S n − k . k =1 Theorem The count of unknotted cycles of size n +1 is S n . Nathan McNew Unknotted Cycles July 13th, 2018 11

  30. Rooted-Signed-Binary-Trees Nathan McNew Unknotted Cycles July 13th, 2018 12

  31. Rooted-Signed-Binary-Trees Definition A rooted-signed-binary tree is a rooted binary tree where each non-root node is either positive or negative. Nathan McNew Unknotted Cycles July 13th, 2018 12

  32. Rooted-Signed-Binary-Trees Definition A rooted-signed-binary tree is a rooted binary tree where each non-root node is either positive or negative. Two trees are equivalent if one can be obtained from another by a series of tree rotations. Nathan McNew Unknotted Cycles July 13th, 2018 12

  33. Rooted-Signed-Binary-Trees Definition A rooted-signed-binary tree is a rooted binary tree where each non-root node is either positive or negative. Two trees are equivalent if one can be obtained from another by a series of tree rotations. The allowed tree rotations are either: Nathan McNew Unknotted Cycles July 13th, 2018 12

  34. Rooted-Signed-Binary-Trees Definition A rooted-signed-binary tree is a rooted binary tree where each non-root node is either positive or negative. Two trees are equivalent if one can be obtained from another by a series of tree rotations. The allowed tree rotations are either: A child node can be rotated into a parent with the same sign. Nathan McNew Unknotted Cycles July 13th, 2018 12

  35. Rooted-Signed-Binary-Trees Definition A rooted-signed-binary tree is a rooted binary tree where each non-root node is either positive or negative. Two trees are equivalent if one can be obtained from another by a series of tree rotations. The allowed tree rotations are either: A child node can be rotated into a parent with the same sign. A node can be rotated into the root. The new node is given the sign of the node rotated into the root. Nathan McNew Unknotted Cycles July 13th, 2018 12

  36. Example: Rooted-signed-binary-trees + − + − Nathan McNew Unknotted Cycles July 13th, 2018 13

  37. Example: Rooted-signed-binary-trees + − + − + + − − Nathan McNew Unknotted Cycles July 13th, 2018 13

  38. Example: Rooted-signed-binary-trees + − + + − + + − + − − − Nathan McNew Unknotted Cycles July 13th, 2018 13

  39. The bijection Nathan McNew Unknotted Cycles July 13th, 2018 14

  40. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Nathan McNew Unknotted Cycles July 13th, 2018 14

  41. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Use the signed tree to keep track of how points are inserted. Nathan McNew Unknotted Cycles July 13th, 2018 14

  42. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Use the signed tree to keep track of how points are inserted. Assign the tree with only the unsigned root to the cycle σ = 21. Nathan McNew Unknotted Cycles July 13th, 2018 14

  43. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Use the signed tree to keep track of how points are inserted. Assign the tree with only the unsigned root to the cycle σ = 21. Number the places a leaf could be added to the tree. To add a node to the tree into the i th position of the tree: Nathan McNew Unknotted Cycles July 13th, 2018 14

  44. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Use the signed tree to keep track of how points are inserted. Assign the tree with only the unsigned root to the cycle σ = 21. Number the places a leaf could be added to the tree. To add a node to the tree into the i th position of the tree: For a positive node insert i +1 prior to the element in position i . Increment each element in the cycle that had value i +1 or more. Nathan McNew Unknotted Cycles July 13th, 2018 14

  45. The bijection Key observation: Inserting a point in a cycle diagram immediately above or below the diagonal does not affect the knot type. Use the signed tree to keep track of how points are inserted. Assign the tree with only the unsigned root to the cycle σ = 21. Number the places a leaf could be added to the tree. To add a node to the tree into the i th position of the tree: For a positive node insert i +1 prior to the element in position i . Increment each element in the cycle that had value i +1 or more. For a negative node insert i after the element in position i . Increment each element in the cycle that had value i or greater. Nathan McNew Unknotted Cycles July 13th, 2018 14

  46. The bijection Before insertion After inserting ⊕ After inserting ⊖ Nathan McNew Unknotted Cycles July 13th, 2018 15

  47. Example Nathan McNew Unknotted Cycles July 13th, 2018 16

  48. Example + − + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  49. Example + − + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  50. Example + − + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  51. Example + − + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  52. Example + − + + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  53. Example + − + + − Nathan McNew Unknotted Cycles July 13th, 2018 16

  54. Example + − + + + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  55. Example + − + + + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  56. Example + − + + + + − + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  57. Example + − + + + + − + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  58. Example + − + + + + − + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  59. Example + − + + + + − + − + Nathan McNew Unknotted Cycles July 13th, 2018 16

  60. Ideas of proof Nathan McNew Unknotted Cycles July 13th, 2018 17

  61. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: Nathan McNew Unknotted Cycles July 13th, 2018 17

  62. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: Nathan McNew Unknotted Cycles July 13th, 2018 17

  63. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Nathan McNew Unknotted Cycles July 13th, 2018 17

  64. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: Nathan McNew Unknotted Cycles July 13th, 2018 17

  65. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: � Map from trees to cycles is injective: Nathan McNew Unknotted Cycles July 13th, 2018 17

  66. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: � Map from trees to cycles is injective: � Nathan McNew Unknotted Cycles July 13th, 2018 17

  67. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: � Map from trees to cycles is injective: � Map from trees to cycles is surjective: Nathan McNew Unknotted Cycles July 13th, 2018 17

  68. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: � Map from trees to cycles is injective: � Map from trees to cycles is surjective: ...not so easy. Nathan McNew Unknotted Cycles July 13th, 2018 17

  69. Ideas of proof Show large Scr¨ oder numbers count rooted-signed-binary-trees: � Well-defined as to the order vertices are added to a tree: � Well-defined on equivalent trees after a rotation: � Map from trees to cycles is injective: � Map from trees to cycles is surjective: ...not so easy. To show surjectivity, it would suffice to show that every unknotted cycle, σ , has a point on the off-diagonal, i.e | σ ( i ) − i | = 1. Nathan McNew Unknotted Cycles July 13th, 2018 17

  70. Topology Nathan McNew Unknotted Cycles July 13th, 2018 18

  71. Topology Let σ be a cycle. Nathan McNew Unknotted Cycles July 13th, 2018 18

Recommend

There exist infinitely many unknotted winding number one satellite operators on knot concordance

There exist infinitely many unknotted winding number one satellite operators on knot concordance

Introduction The satellite construction Main theorem Tools Proofs There exist infinitely many unknotted winding number one satellite operators on knot concordance Arunima Ray Rice University 2013 Lehigh University Geometry and Topology

814 views • 63 slides
Three-colourability of planar graphs without 5-cycles and triangular 3- and 6-cycles Asiyeh

Three-colourability of planar graphs without 5-cycles and triangular 3- and 6-cycles Asiyeh

Three-colourability of planar graphs without 5-cycles and triangular 3- and 6-cycles Asiyeh Sanaei Brock University Joint work with Babak Farzad June 12, 2013 1 / 80 Graph Colouring; An Introduction Figure : A colouring of vertices of a

1.34k views • 77 slides
Life Cycles Return to Table of Contents Slide 6 / 115 Living and Nonliving Think back to what

Life Cycles Return to Table of Contents Slide 6 / 115 Living and Nonliving Think back to what

Slide 1 / 115 Slide 2 / 115 3 rd Grade PSI Growth and Development of Organisms 2015-12-06 www.njctl.org Slide 3 / 115 Table of Contents Click on the topic to go to that section Life Cycles Plant Life Cycles Animal Life Cycles

417 views • 39 slides
Global Climate Change Mil ilankovitch Cycles Comprised of 3 dominant cycles: 1. Eccentricity

Global Climate Change Mil ilankovitch Cycles Comprised of 3 dominant cycles: 1. Eccentricity

Global Climate Change Mil ilankovitch Cycles Comprised of 3 dominant cycles: 1. Eccentricity 2. Axial Tilt 3. Precession Named after Milutin Milankovitch. Serbian astronomer/mathematician. Credited with calculating their magnitude.

800 views • 42 slides
UX Case Study Created by Lisa Savoie for client: City Cycles Introduction As part of my

UX Case Study Created by Lisa Savoie for client: City Cycles Introduction As part of my

UX Case Study Created by Lisa Savoie for client: City Cycles Introduction As part of my Skillcrush UX class, I was tasked with conducting a UX review of City Cycles website. City Cycles is a bike rental shop in Riverside, Missouri. They cater

1.25k views • 10 slides
UX Case Study Created by Joy Fonderson for client: City Cycles Introduction As part of my

UX Case Study Created by Joy Fonderson for client: City Cycles Introduction As part of my

UX Case Study Created by Joy Fonderson for client: City Cycles Introduction As part of my Skillcrush UX class, I was tasked with: improving the user experience of an existing web app for a client named City Cycles. The City Cycles site lets

286 views • 9 slides
Indirect Transmitted Infectious Diseases: from Microscopic Cycles to Macroscopic Cycles Jude D.

Indirect Transmitted Infectious Diseases: from Microscopic Cycles to Macroscopic Cycles Jude D.

Indirect Transmitted Infectious Diseases: from Microscopic Cycles to Macroscopic Cycles Jude D. Kong Department of Maths. and Stat. Sciences University of Alberta Indirect Transmitted Infectious Diseases November 12, 2013 1 / 24 John

468 views • 24 slides
Richard Garet www.richardgaret.com 1 30 Cycles of Flux is a sound piece that consists of an

Richard Garet www.richardgaret.com 1 30 Cycles of Flux is a sound piece that consists of an

Richard Garet www.richardgaret.com 1 30 Cycles of Flux is a sound piece that consists of an oscillator emitting a 30 cycles wave (right below human beings hearing range) to activate speaker cones with white strings attached to the center of each

403 views • 19 slides
Power cycle development Steam cycles dominant for >300 yrs, mostly Rankine Gas Brayton

Power cycle development Steam cycles dominant for >300 yrs, mostly Rankine Gas Brayton

Power cycle development Steam cycles dominant for >300 yrs, mostly Rankine Gas Brayton cycles catching up last 50 years Organic Rankine Cycles (ORC) relatively recent 2 Why a new power cycle? Steam Good efficiency at

421 views • 23 slides
Optimized geothermal Optimized geothermal binary power cycles binary power cycles Kontoleontos

Optimized geothermal Optimized geothermal binary power cycles binary power cycles Kontoleontos

ENhanced hanced G Geothermal eothermal I Innovative nnovative N Network for etwork for E Europe ( urope (ENGINE ENGINE) ) EN Optimized geothermal Optimized geothermal binary power cycles binary power cycles Kontoleontos E.,

412 views • 13 slides
1 Start: policy makers views on macro -finance 1. Framing: why study financial cycles?

1 Start: policy makers views on macro -finance 1. Framing: why study financial cycles?

1 Start: policy makers views on macro -finance 1. Framing: why study financial cycles? Financial cycles as part of macro-financial linkages Theories on why and how financial cycles arise 2. How to Identify Financial (and Business)

740 views • 32 slides
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs Kyle Fox University of

Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs Kyle Fox University of

Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs Kyle Fox University of Illinois at Urbana-Champaign Surfaces 2-manifolds (with boundary) genus g : max # of disjoint simple cycles whose compliment is connected =

697 views • 55 slides
Computing Shortest Non-trivial Cycles in Directed Surface Graphs Kyle Fox University of

Computing Shortest Non-trivial Cycles in Directed Surface Graphs Kyle Fox University of

Computing Shortest Non-trivial Cycles in Directed Surface Graphs Kyle Fox University of Illinois at Urbana-Champaign Saturday, February 11, 12 Surfaces 2-manifolds (with boundary) genus g : max # of disjoint simple cycles whose

953 views • 59 slides
Introduction Farmland was susceptible to two boom-bust cycles in the last century 1920s

Introduction Farmland was susceptible to two boom-bust cycles in the last century 1920s

Who Leveraged the Farm? Allen M. Featherstone Kansas State University Introduction Farmland was susceptible to two boom-bust cycles in the last century 1920s and 1930s 1973 through 1986 Drivers of Boom-Bust Cycles Economic

569 views • 12 slides
Cache and Syphilis RootedCON 2019 Haswell (4th generation) architecture Cache latencies:

Cache and Syphilis RootedCON 2019 Haswell (4th generation) architecture Cache latencies:

Cache and Syphilis RootedCON 2019 Haswell (4th generation) architecture Cache latencies: L1 ~5 cycles L2 ~12 cycles L3 ~50 cycles DRAM ~50 cycles + 50 ns (RAM) Coherence: Inclusive vs. non-inclusive vs. exclusive

1.02k views • 56 slides
More Than A Network: Distributed OLTP on Clusters of Hardware Islands Danica Porobic , Pnar

More Than A Network: Distributed OLTP on Clusters of Hardware Islands Danica Porobic , Pnar

More Than A Network: Distributed OLTP on Clusters of Hardware Islands Danica Porobic , Pnar Tzn, Raja Appuswamy, Anastasia Ailamaki 1 Multisocket multicores 21 cycles 72 cycles 2x12-core 237 cycles Intel Xeon E5-2650L v3 threads

554 views • 14 slides
Discussion of Business, Housing and Credit Cycles by Gerhard Runstler and Marente Vlekke By

Discussion of Business, Housing and Credit Cycles by Gerhard Runstler and Marente Vlekke By

Discussion of Business, Housing and Credit Cycles by Gerhard Runstler and Marente Vlekke By David Aikman* Bank of England Estimating and Interpreting Financial Cycles De Nederlandsche Bank, 2 September 2016, Amsterdam * The views

416 views • 12 slides
L ECTURE 11: D YNAMICAL S YSTEMS 10 T EACHER : G IANNI A. D I C ARO L IMIT CYCLES So far

L ECTURE 11: D YNAMICAL S YSTEMS 10 T EACHER : G IANNI A. D I C ARO L IMIT CYCLES So far

15-382 C OLLECTIVE I NTELLIGENCE S19 L ECTURE 11: D YNAMICAL S YSTEMS 10 T EACHER : G IANNI A. D I C ARO L IMIT CYCLES So far Unstable equilibrium Periodic orbit: ! " + $ = !(") ( -limit set of points Something new: limit cycles

184 views • 16 slides
Timekeeping in the Linux Kernel Stephen Boyd Qualcomm Innovation Center, Inc. 1 / 40 In the

Timekeeping in the Linux Kernel Stephen Boyd Qualcomm Innovation Center, Inc. 1 / 40 In the

Timekeeping in the Linux Kernel Stephen Boyd Qualcomm Innovation Center, Inc. 1 / 40 In the beginning ... 2 / 40 there was a counter 0000ec544fef3c8a 3 / 40 Calculating the Passage of Time (in ns) c cycles c cycles c cycles = = ( )

914 views • 40 slides
CDS 140b: Control of Bifurcations and Limit Cycles Richard M. Murray Caltech Control and

CDS 140b: Control of Bifurcations and Limit Cycles Richard M. Murray Caltech Control and

CDS 140b: Control of Bifurcations and Limit Cycles Richard M. Murray Caltech Control and Dynamical Systems February 2008 Goals Describe how bifurcations & limit cycles arise in engineering applications Review some tools for

398 views • 10 slides
Hierarchies Biswabandan Panda WOCS 2018 December 8 th , 2018 Memory in Single-core Systems DRAM

Hierarchies Biswabandan Panda WOCS 2018 December 8 th , 2018 Memory in Single-core Systems DRAM

L3 Time for Compressed Memory Hierarchies Biswabandan Panda WOCS 2018 December 8 th , 2018 Memory in Single-core Systems DRAM Contr. L3 Core L1 L2 4 Cycles 12 Cycles 30 Cycles 200 Cycles Latency wall DRAM was already critical for

673 views • 46 slides
Ceresa cycles of Fermat curves and Hodge theory of fundamental groups Payman Eskandari

Ceresa cycles of Fermat curves and Hodge theory of fundamental groups Payman Eskandari

Ceresa cycles of Fermat curves and Hodge theory of fundamental groups Payman Eskandari (University of Toronto) Fields Institute, Toronto August 12, 2020 Relations on algebraic cycles Recall that one has (among others) the notions of rational,

323 views • 21 slides
Whats News In Business Cycles? Stephanie Schmitt-Groh e Mart n Uribe Columbia

Whats News In Business Cycles? Stephanie Schmitt-Groh e Mart n Uribe Columbia

Whats News In Business Cycles? Stephanie Schmitt-Groh e Mart n Uribe Columbia University April 19, 2010 1 News as a Source of Business Cycles Theoretical papers: Barro and King, (QJE, 1984); Beaudry and Portier (JET,

873 views • 28 slides
1 CPI (cycles per instruction) CPI (cycles per instruction) Parallelism to save time

1 CPI (cycles per instruction) CPI (cycles per instruction) Parallelism to save time

Processor Execution time Processor Execution time Processor Processor Clock Cycles Instructio n Count Cycles per Instructio n = Performance and Performance and CPU Time Instructio n Count CPI Clock period =

472 views • 4 slides

More recommend