PreprintarXiv licencearXiv
Optimal-diameter partitions into regions of the prescribed measure
Abstract
In this paper we find a sufficient condition on an Ahlfors--David regular metric measure space under which it admits a partition into parts of prescribed measures and optimal (up to a constant) diameters. The proof uses the construction of dyadic cubes. The process is algorithmic: the pieces are cut out one by one via a filling procedure on the tree of dyadic cubes. We introduce the notion of spaces which admit a connected dyadic cube decomposition and prove that they admit a partition of the kind described above. We then develop several techniques to obtain such spaces and show some natural examples of this type.
Related
- The optimal diameter estimate for positive Yamabe metrics
- Optimal design problems for the fractional g-Laplacian at prescribed energy level
- Optimal Convergence of Quadratic Not-a-Knot Spline Interpolation on Arbitrary Partitions
- The Interconnectedness Coefficient: A Semi-Local Graph-Theoretic Measure for Connector Vertices between Cohesive Network Regions
- Optimal Control of State Constrained Systems via Measure Relaxations and Polynomial Optimization
BibTeX
@misc{voinov2026optimaldiameter,
title = {{Optimal-diameter partitions into regions of the prescribed measure}},
author = {Grigory Voinov},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.23867},
eprint = {2609.23867},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.23867},
}
RIS
TY - UNPB
TI - Optimal-diameter partitions into regions of the prescribed measure
AU - Grigory Voinov
PY - 2026
DA - 2026/09/20
PB - arXiv
DO - 10.48550/arxiv.2609.23867
UR - https://arxiv.org/abs/2609.23867
AB - In this paper we find a sufficient condition on an Ahlfors--David regular metric measure space under which it admits a partition into parts of prescribed measures and optimal (up to a constant) diameters. The proof uses the construction of dyadic cubes. The process is algorithmic: the pieces are cut out one by one via a filling procedure on the tree of dyadic cubes. We introduce the notion of spaces which admit a connected dyadic cube decomposition and prove that they admit a partition of the kind described above. We then develop several techniques to obtain such spaces and show some natural examples of this type.
ER -