On Freedman's link packings

被引:0
作者
Manin, Fedor [1 ]
Portnoy, Elia [2 ]
机构
[1] Univ Calif Santa Barbara, Dept Math, Santa Barbara, CA 93106 USA
[2] MIT, Dept Math, Cambridge, MA USA
关键词
Links; geometric knot theory; packing; Milnor invariants; ROPELENGTH; INVARIANTS;
D O I
10.1142/S1793525324500481
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Recently, Freedman introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that these bounds seemed far too large. We show that the smallest of these "extravagantly large" bounds is in fact sharp by constructing, for any link, a packing of exponentially many copies as a function of the available volume. We also produce improved and generalized upper bounds.
引用
收藏
页数:20
相关论文
共 17 条