Linear independence of zigzag words in the algebra T
Linear independence of zigzag words in the algebra T
Fix a nonnegative integer , a sequence of scalars in satisfying the distinctness condition and the stated recurrence condition, and let be the corresponding -algebra. A zigzag word is a word in the generators of whose successive starred and nonstarred elements alternate. Linear-independence conjecture. For every integer , each of the following sets is linearly independent: the zigzag words of length in that begin with a nonstarred element, and the zigzag words of length in that begin with a starred element. This would clarify the structure and linear independence of the natural spanning words in , but the source gives no resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Kazumasa Nomura and Paul Terwilliger, “On the shape of a tridiagonal pair”, arXiv:0906.3838 (2009).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.