Sharp approximation thresholds for power means of common-subspace volumes
Abstract
We study how well a single k-dimensional subspace can preserve volume from several positive semidefinite matrices at once. Each matrix is compressed to the subspace and scored by the geometric mean of the eigenvalues of that compression; the scores are aggregated by a weighted power mean of order p ≤ 1. For every fixed k and every fixed rational p we determine the optimal approximation factor: it is achieved by a randomized polynomial-time algorithm, and every larger constant is NP-hard. Above a critical power (p=−k/2 over the reals and p=−k over the complex numbers) the factor is an explicit product of Gamma functions. At and below the critical power, every positive constant-factor approximation is NP-hard. The factor comes from a concave relaxation over the positive semidefinite matrices of trace one, which agrees with the volume score at every subspace, followed by ordinary Gaussian rounding. For two rank-k matrices the relaxation is exact, giving a closed-form optimum for Martin means of two subspaces.
Related
- Subspace Uncertainty and Sharp Sampling Thresholds on the Boolean Cube
- Wasserstein Stability, Couplings Across Volumes, and the 1+1/d Moment Thresholds in the Edwards--Anderson Model
- Approximation algorithm for mixed volumes of a constant number of convex bodies
- Sharp Quadratic Bounds for Anticanonical Volumes of Weak Fano Surfaces
- Sharp Polynomial Upper Bounds for Anticanonical Volumes
BibTeX
@misc{peregudin2026sharp,
title = {{Sharp approximation thresholds for power means of common-subspace volumes}},
author = {Alexey Peregudin},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39148},
eprint = {2610.39148},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39148},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Sharp approximation thresholds for power means of common-subspace volumes
AU - Alexey Peregudin
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39148
UR - https://arxiv.org/abs/2610.39148
AB - We study how well a single k-dimensional subspace can preserve volume from several positive semidefinite matrices at once. Each matrix is compressed to the subspace and scored by the geometric mean of the eigenvalues of that compression; the scores are aggregated by a weighted power mean of order p ≤ 1. For every fixed k and every fixed rational p we determine the optimal approximation factor: it is achieved by a randomized polynomial-time algorithm, and every larger constant is NP-hard. Above a critical power (p=−k/2 over the reals and p=−k over the complex numbers) the factor is an explicit product of Gamma functions. At and below the critical power, every positive constant-factor approximation is NP-hard. The factor comes from a concave relaxation over the positive semidefinite matrices of trace one, which agrees with the volume score at every subspace, followed by ordinary Gaussian rounding. For two rank-k matrices the relaxation is exact, giving a closed-form optimum for Martin means of two subspaces.
ER -