Dimension-counting bounds for equi-isoclinic subspaces
By: Joseph W. Iverson, Kaysie Rose O
Potential Business Impact:
Finds more ways to pack information efficiently.
We make four contributions to the theory of optimal subspace packings and equi-isoclinic subspaces: (1) a new lower bound for block coherence, (2) an exact count of equi-isoclinic subspaces of even dimension $r$ in $\mathbb{R}^{2r+1}$ with parameter $α\neq \tfrac{1}{2}$, (3) a new upper bound for the number of $r$-dimensional equi-isoclinic subspaces in $\mathbb{R}^d$ or $\mathbb{C}^d$, and (4) a proof that when $d=2r$, a further refinement of this bound is attained for every $r$ in the complex case and every $r=2^k$ in the real case. For each of these contributions, the proof ultimately relies on a dimension count.
Similar Papers
Approximate Counting in Local Lemma Regimes
Data Structures and Algorithms
Counts hard-to-count things much faster.
Algorithmic Information Bounds for Distances and Orthogonal Projections
Computational Complexity
Makes computer data keep more information.
Improved Sample Complexity for Full Coverage in Compact and Continuous Spaces
Machine Learning (CS)
Finds more things with fewer tries.