On the number of harmonic frames
Simon Marshall, Shayne Waldron

TL;DR
This paper studies the growth and enumeration of cyclic harmonic frames, showing they grow roughly like n^{d-1} and providing formulas and estimates for their count.
Contribution
It proves the asymptotic growth of the number of cyclic harmonic frames and offers exact formulas and estimates using algebraic and group theoretic methods.
Findings
Asymptotic estimate: h_{n,d} ≈ n^d / φ(n) as n→∞
Growth rate of cyclic harmonic frames is approximately n^{d-1}
Provides exact formulas and counts for cyclic harmonic frames
Abstract
There is a finite number of tight frames of distinct vectors for which are the orbit of a vector under a unitary action of the cyclic group . These cyclic harmonic frames (or geometrically uniform tight frames) are used in signal analysis and quantum information theory, and provide many tight frames of particular interest. Here we investigate the conjecture that grows like . By using a result of Laurent which describes the set of solutions of algebraic equations in roots of unity, we prove the asymptotic estimate By using a group theoretic approach, we also give some exact formulas for , and estimate the number of cyclic harmonic frames up to projective unitary equivalence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Advanced Numerical Analysis Techniques · Image and Signal Denoising Methods
