Yueheng Bao, Ari Benveniste, Marion Campisi, Nicholas Cazet, Ansel Goh, Jiantong Liu, Ethan Sherman
{"title":"简单六方格中的界限和 11 棍结的分类","authors":"Yueheng Bao, Ari Benveniste, Marion Campisi, Nicholas Cazet, Ansel Goh, Jiantong Liu, Ethan Sherman","doi":"10.1142/s0218216523500979","DOIUrl":null,"url":null,"abstract":"<p>The <i>stick number</i> and the <i>edge length</i> of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a linear transformation between lattices, we prove that for any given knot both values in the sh-lattice are strictly less than the values in the cubic lattice. Finally, we show that the only non-trivial <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mn>1</mn><mn>1</mn></math></span><span></span>-stick knots in the sh-lattice are the trefoil knot (<span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mn>3</mn></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>) and the figure-eight knot (<span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mn>4</mn></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>).</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounds in simple hexagonal lattice and classification of 11-stick knots\",\"authors\":\"Yueheng Bao, Ari Benveniste, Marion Campisi, Nicholas Cazet, Ansel Goh, Jiantong Liu, Ethan Sherman\",\"doi\":\"10.1142/s0218216523500979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The <i>stick number</i> and the <i>edge length</i> of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a linear transformation between lattices, we prove that for any given knot both values in the sh-lattice are strictly less than the values in the cubic lattice. Finally, we show that the only non-trivial <span><math altimg=\\\"eq-00001.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mn>1</mn><mn>1</mn></math></span><span></span>-stick knots in the sh-lattice are the trefoil knot (<span><math altimg=\\\"eq-00002.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mn>3</mn></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>) and the figure-eight knot (<span><math altimg=\\\"eq-00003.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mn>4</mn></mrow><mrow><mn>1</mn></mrow></msub></math></span><span></span>).</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1142/s0218216523500979\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1142/s0218216523500979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
简单六方格(sh-lattice)中的绳结类型的棍数和边长分别是在 sh-lattice 中构建给定类型的绳结所需的最小棍数和边长。通过引入网格间的线性变换,我们证明了对于任何给定的结,sh-网格中的两个值都严格小于立方网格中的值。最后,我们证明了在 sh 格中唯一的非难 11 棍结是三叶草结 (31) 和八字结 (41)。
Bounds in simple hexagonal lattice and classification of 11-stick knots
The stick number and the edge length of a knot type in the simple hexagonal lattice (sh-lattice) are the minimal numbers of sticks and edges required, respectively, to construct a knot of the given type in sh-lattice. By introducing a linear transformation between lattices, we prove that for any given knot both values in the sh-lattice are strictly less than the values in the cubic lattice. Finally, we show that the only non-trivial -stick knots in the sh-lattice are the trefoil knot () and the figure-eight knot ().