English

Sampling Finite Unit Norm Tight Frames Using Symplectic Geometry

Functional Analysis 2025-05-30 v1 Symplectic Geometry

Abstract

Unit-norm tight frames in finite-dimensional Hilbert spaces (FUNTFs) are fundamental in signal processing, offering optimal robustness to noise and measurement loss. In this paper we introduce the Eigenlift algorithm for sampling random FUNTFs. Our approach exploits the symplectic geometry of the FUNTF space, which we characterize as a symplectic reduction of frame space by a symmetry group. We then define a Hamiltonian torus action on this reduced space whose momentum map induces a fiber bundle structure. The algorithm proceeds by sampling a point from the base space, which is a convex polytope, lifting it deterministically to a point on the corresponding fiber, then acting on this point by a random element of the torus to obtain a random FUNTF. We implement the method in Python and validate it in low-dimensional settings where it is computationally feasible to sample the base polytope via rejection sampling.

Keywords

Cite

@article{arxiv.2505.22847,
  title  = {Sampling Finite Unit Norm Tight Frames Using Symplectic Geometry},
  author = {Mason Faldet and Clayton Shonkwiler},
  journal= {arXiv preprint arXiv:2505.22847},
  year   = {2025}
}

Comments

23 page, 5 figures

R2 v1 2026-07-01T02:47:21.573Z