On Freedman's link packings

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Manin, Fedor, Portnoy, Elia
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917808926883840
author Manin, Fedor
Portnoy, Elia
author_facet Manin, Fedor
Portnoy, Elia
contents Recently, Freedman [arXiv:2301.00295] 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.
format Preprint
id arxiv_https___arxiv_org_abs_2308_08064
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle On Freedman's link packings
Manin, Fedor
Portnoy, Elia
Geometric Topology
Metric Geometry
57K10, 53A04, 53C42
Recently, Freedman [arXiv:2301.00295] 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.
title On Freedman's link packings
topic Geometric Topology
Metric Geometry
57K10, 53A04, 53C42
url https://arxiv.org/abs/2308.08064