{"title":"若干Lebesgue测度为0的线性集的填充函数","authors":"Austin Anderson , Steven Damelin","doi":"10.1016/j.jco.2025.101990","DOIUrl":null,"url":null,"abstract":"<div><div>We use a characterization of Minkowski measurability to study the asymptotics of best packing on cut-out subsets of the real line with Minkowski dimension <span><math><mi>d</mi><mo>∈</mo><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>. Our main result is a proof that Minkowski measurability is a sufficient condition for the existence of best packing asymptotics on monotone rearrangements of these sets. For each such set, the main result provides an explicit constant of proportionality <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span>, depending only on the Minkowski dimension <em>d</em>, that relates its packing limit and Minkowski content. We later use the Digamma function to study the limiting value of <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span> as <span><math><mi>d</mi><mo>→</mo><msup><mrow><mn>1</mn></mrow><mrow><mo>−</mo></mrow></msup></math></span>. This study further provides two sharpness results illustrating the necessity of the hypotheses of the main result. Finally, the aforementioned characterization of Minkowski measurability motivates the asymptotic study of an infinite multiple subset sum problem.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"92 ","pages":"Article 101990"},"PeriodicalIF":1.8000,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the packing functions of some linear sets of Lebesgue measure zero\",\"authors\":\"Austin Anderson , Steven Damelin\",\"doi\":\"10.1016/j.jco.2025.101990\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We use a characterization of Minkowski measurability to study the asymptotics of best packing on cut-out subsets of the real line with Minkowski dimension <span><math><mi>d</mi><mo>∈</mo><mo>(</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>. Our main result is a proof that Minkowski measurability is a sufficient condition for the existence of best packing asymptotics on monotone rearrangements of these sets. For each such set, the main result provides an explicit constant of proportionality <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span>, depending only on the Minkowski dimension <em>d</em>, that relates its packing limit and Minkowski content. We later use the Digamma function to study the limiting value of <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>d</mi></mrow></msub></math></span> as <span><math><mi>d</mi><mo>→</mo><msup><mrow><mn>1</mn></mrow><mrow><mo>−</mo></mrow></msup></math></span>. This study further provides two sharpness results illustrating the necessity of the hypotheses of the main result. Finally, the aforementioned characterization of Minkowski measurability motivates the asymptotic study of an infinite multiple subset sum problem.</div></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":\"92 \",\"pages\":\"Article 101990\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2025-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0885064X25000688\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X25000688","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
On the packing functions of some linear sets of Lebesgue measure zero
We use a characterization of Minkowski measurability to study the asymptotics of best packing on cut-out subsets of the real line with Minkowski dimension . Our main result is a proof that Minkowski measurability is a sufficient condition for the existence of best packing asymptotics on monotone rearrangements of these sets. For each such set, the main result provides an explicit constant of proportionality , depending only on the Minkowski dimension d, that relates its packing limit and Minkowski content. We later use the Digamma function to study the limiting value of as . This study further provides two sharpness results illustrating the necessity of the hypotheses of the main result. Finally, the aforementioned characterization of Minkowski measurability motivates the asymptotic study of an infinite multiple subset sum problem.
期刊介绍:
The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited.
Areas Include:
• Approximation theory
• Biomedical computing
• Compressed computing and sensing
• Computational finance
• Computational number theory
• Computational stochastics
• Control theory
• Cryptography
• Design of experiments
• Differential equations
• Discrete problems
• Distributed and parallel computation
• High and infinite-dimensional problems
• Information-based complexity
• Inverse and ill-posed problems
• Machine learning
• Markov chain Monte Carlo
• Monte Carlo and quasi-Monte Carlo
• Multivariate integration and approximation
• Noisy data
• Nonlinear and algebraic equations
• Numerical analysis
• Operator equations
• Optimization
• Quantum computing
• Scientific computation
• Tractability of multivariate problems
• Vision and image understanding.