Dimension-counting bounds for equi-isoclinic subspaces

TL;DR

This paper introduces new bounds and exact counts for equi-isoclinic subspaces, advancing the understanding of optimal subspace packings through dimension counting techniques.

Contribution

It provides four main contributions: a new lower bound for block coherence, an exact count of certain equi-isoclinic subspaces, a new upper bound on their number, and refined bounds in specific cases.

Findings

New lower bound for block coherence

Exact count of equi-isoclinic subspaces in specific dimensions

Refined bounds for subspace configurations when d=2r

Abstract

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 $\alpha \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.