Uniform bound on the strength of Q-polynomial spherical embeddings

Establish an absolute constant K>0 such that the spherical embedding with respect to a corresponding Q-polynomial idempotent of every Q-polynomial association scheme with multiplicity m≥3 has strength at most K, and determine whether K=11 is admissible.

Background

The paper proves that, for a P- and Q-polynomial association scheme with at least three classes and a corresponding Q-polynomial idempotent of multiplicity at least three, the associated spherical embedding has strength at most five. The concluding problem asks whether any Q-polynomial association scheme, without the P-polynomial hypothesis, admits a uniform upper bound on the strength of its spherical embedding.

The proposed value K=11 is motivated by the known restriction that tight spherical t-designs in dimensions m≥3 can occur only for t∈{1,2,3,4,5,7,11}. The question is presented as a dual analogue of the conjectured universal upper bound on the girth of distance-regular graphs.

References

Show that there exists an absolute constant $K>0$ such that we have $t(\tilde{X})\leqslant K$ for the spherical embedding $\tilde{X}$ of every $Q$-polynomial association scheme $(X,\mathcal{R})$ with respect to a corresponding $Q$-polynomial idempotent $E$, provided that the multiplicity $m\geqslant 3$. Can we take $K=11$?

On the spherical design properties of a $P$- and $Q$-polynomial association scheme  (2608.27082 - Lansdown et al., 27 Aug 2026) in Section 5, Concluding remarks; displayed Problem following Corollary 5.4