Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

Rank Stabilization for Sparse Coordinate Completion of Unit-Norm Tight Frames

Abstract

We determine generic completion-fiber dimensions for unit-norm tight frames when each partially observed column has exactly two missing coordinates. We work on the complex algebraic variety defined by the real frame equations. The missing coordinate pairs form a labelled multigraph. For every d≥4 and every frame length R≥ Nd:=binomd+12−1, we prove that the missing-pair Jacobian matroid is the Rado matroid of an explicit subspace arrangement. Its rank is therefore given by a graph-theoretic minimum formula and is independent of R; the complementary rank defect is the generic fiber dimension. The main step is a realization theorem at length Nd. It combines a transversal--graphic matroid partition with a zero-coordinate moment submersion and a compatible decomposition of a generic residual matrix. Basis extension and stability under fully observed columns then yield the rank formula at every larger length. We also give an explicit defect formula in dimension four and a local real counterpart on the smooth real frame locus. A common-rotation obstruction bounds the smallest uniform stabilization threshold from below by 2d−1.

Related

  1. Completion of Equiangular Tight Frames via QR Decomposition
    Jun Ji, Long Wang
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles
    Farhad Farokhi, Shuixin Xiao
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  3. Shot-location polarization and post-2018 pace stabilization in the NBA: Evidence from 21 seasons of team and shot-coordinate data (2004–2025)
    Shuming Cui, Zhenxing Yang, Hemu Du +2
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsPLOS
  4. Off-Grid Point-Scatterer Localization from Sparse Limited-Aperture Data via Hankel Completion
    Jingzhi Li, Xiliang Lu, Juntao You
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Feature Priming in Online Linear Regression: Sparse-Regret Lower Bounds and Tight Coordinatewise Rates
    Huibo Xu, Shi Fu, Qixin Zhang +1
    arXivPreprintCC BY-NC-SA 4.0Full textStatisticsarXiv
BibTeX
@misc{li2026rank,
  title = {{Rank Stabilization for Sparse Coordinate Completion of Unit-Norm Tight Frames}},
  author = {Dongwei Li},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.33388},
  eprint = {2609.33388},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.33388},
}
RIS
TY  - UNPB
TI  - Rank Stabilization for Sparse Coordinate Completion of Unit-Norm Tight Frames
AU  - Dongwei Li
PY  - 2026
DA  - 2026/09/27
PB  - arXiv
DO  - 10.48550/arxiv.2609.33388
UR  - https://arxiv.org/abs/2609.33388
AB  - We determine generic completion-fiber dimensions for unit-norm tight frames when each partially observed column has exactly two missing coordinates. We work on the complex algebraic variety defined by the real frame equations. The missing coordinate pairs form a labelled multigraph. For every d≥4 and every frame length R≥ N_d:=binomd+12−1, we prove that the missing-pair Jacobian matroid is the Rado matroid of an explicit subspace arrangement. Its rank is therefore given by a graph-theoretic minimum formula and is independent of R; the complementary rank defect is the generic fiber dimension. The main step is a realization theorem at length N_d. It combines a transversal--graphic matroid partition with a zero-coordinate moment submersion and a compatible decomposition of a generic residual matrix. Basis extension and stability under fully observed columns then yield the rank formula at every larger length. We also give an explicit defect formula in dimension four and a local real counterpart on the smooth real frame locus. A common-rotation obstruction bounds the smallest uniform stabilization threshold from below by 2d−1.
ER  -