Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated just now
PreprintarXiv licencearXiv

A covering construction of labelled packing measure and content

Abstract

We introduce labelled packing measure by a covering construction in which each set has an independent positive label bounding its diameter and the radii in its local packing cost. Letting the labels tend to zero defines a metric outer measure Ms. For every s>0 and every metric space (X,d), we prove 2−sPs(F)≤Ms(F) ≤ C(s) Ps(F) (F⊂ X), where $ P^s(F)$ is the classical packing measure and C(s) depends only on s. Thus labelled packing measure and classical packing measure have the same null sets and critical exponent. Allowing arbitrary finite positive labels defines labelled packing content. At the common positive Hausdorff and packing dimension, this content and the labelled packing measure agree on cylinders associated with irreducible subshifts of finite type. In particular, equality holds for non-singleton self-similar attractors and components of finite strongly connected graph-directed systems, without separation assumptions.

Related

  1. A proof of the generalized packing-covering conjecture
    Gianira N. Alfarano, Giuseppe Marino, Alessandro Neri +1
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsHALarXiv
  2. A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five
    Sven Ahrend, Mathieu Dutour Sikirić
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. Auxiliary Codes and the Generalized Packing-Covering Conjecture
    Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. On the Generalized Packing and Covering Radii of Codes
    Wenjun Yu, Moshe Schwartz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. The packing and covering number of trees are local
    Caelan Atamanchuk, Simon Briend, Serte Donderwinkel +1
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
BibTeX
@misc{liu2026covering,
  title = {{A covering construction of labelled packing measure and content}},
  author = {Peizhi Liu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.26335},
  eprint = {2609.26335},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.26335},
}
RIS
TY  - UNPB
TI  - A covering construction of labelled packing measure and content
AU  - Peizhi Liu
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2609.26335
UR  - https://arxiv.org/abs/2609.26335
AB  - We introduce labelled packing measure by a covering construction in which each set has an independent positive label bounding its diameter and the radii in its local packing cost. Letting the labels tend to zero defines a metric outer measure M^s. For every s>0 and every metric space (X,d), we prove 2^−sP^s(F)≤M^s(F) ≤ C(s) P^s(F) (F⊂ X), where $ P^s(F)$ is the classical packing measure and C(s) depends only on s. Thus labelled packing measure and classical packing measure have the same null sets and critical exponent. Allowing arbitrary finite positive labels defines labelled packing content. At the common positive Hausdorff and packing dimension, this content and the labelled packing measure agree on cylinders associated with irreducible subshifts of finite type. In particular, equality holds for non-singleton self-similar attractors and components of finite strongly connected graph-directed systems, without separation assumptions.
ER  -