JOURNAL ARTICLE

On Freedman's link packings.

  • Published In: Journal of Topology & Analysis, 2026, v. 18, n. 3. P. 833 1 of 3

  • Database: Mathematics Source 2 of 3

  • Authored By: Manin, Fedor; Portnoy, Elia 3 of 3

Abstract

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. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Journal of Topology & Analysis. 2026/06, Vol. 18, Issue 3, p833
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2026
  • ISSN:1793-5253
  • DOI:10.1142/S1793525324500481
  • Accession Number:191842212
  • Copyright Statement:Copyright of Journal of Topology & Analysis is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.