Papers › On the existence of Parseval frames for vector bundles

On the existence of Parseval frames for vector bundles

20 Dec 2023arXiv:2312.13488links table onlyarchive 2025-07-28

Samuel A. Ballas, Tom Needham, Clayton Shonkwiler

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Frames in finite-dimensional vector spaces are spanning sets of vectors which provide redundant representations of signals. The Parseval frames are particularly useful and important, since they provide a simple reconstruction scheme and are maximally robust against certain types of noise. In this paper we describe a theory of frames on arbitrary vector bundles -- this is the natural setting for signals which are realized as parameterized families of vectors rather than as single vectors -- and discuss the existence of Parseval frames in this setting. Our approach is phrased in the language of G-bundles, which allows us to use many tools from classical algebraic topology. In particular, we show that orientable vector bundles always admit Parseval frames of sufficiently large size and provide an upper bound on the necessary size. We also give sufficient conditions for the existence of Parseval frames of smaller size for tangent bundles of several families of manifolds, and provide some numerical evidence that Parseval frames on vector bundles share the desirable reconstruction properties of classical Parseval frames.

PaperPDFCode

Code

shonkwiler/frames-on-manifolds officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections