The shape-vector binomial bound for tridiagonal pairs

About 23 years old · traced to

Let A,A∗A,A^* be a tridiagonal pair on a finite-dimensional vector space VV over an algebraically closed field K\mathbb K. Let dd be its diameter, and let (ρ0,ρ1,…,ρd)(\rho_0,\rho_1,\ldots,\rho_d) be its shape vector, where ρi\rho_i is the common dimension of the corresponding eigenspaces of AA and A∗A^*. The shape-vector binomial bound. For 0≤i≤d0\leq i\leq d, one has

ρi≤(di).\rho_i\leq \binom{d}{i}.

The shape vector is already known to be symmetric and unimodal; this conjecture gives a sharper universal upper bound for its entries. Its status is not resolved in the supplied source.

References

Primary source

Paul Terwilliger, “Two linear transformations each tridiagonal with respect to an eigenbasis of the other; an algebraic approach to the Askey scheme of orthogonal polynomials”, arXiv:math/0408390 (2008).

Additional references

2 papers in this index state this conjecture (2003–2004). The statement above is taken from the most recent of them; the others are arXiv:math/0304244.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.