Linear independence of zigzag words in the algebra T

At least 16 years old · documented by

Fix a nonnegative integer dd, a sequence ({θi}i=0d;{θi∗}i=0d)(\{\theta_i\}_{i=0}^d;\{\theta^*_i\}_{i=0}^d) of scalars in K\mathbb{K} satisfying the distinctness condition and the stated recurrence condition, and let TT be the corresponding K\mathbb{K}-algebra. A zigzag word is a word in the generators of TT whose successive starred and nonstarred elements alternate. Linear-independence conjecture. For every integer n≥1n\geq 1, each of the following sets is linearly independent: the zigzag words of length nn in TT that begin with a nonstarred element, and the zigzag words of length nn in TT that begin with a starred element. This would clarify the structure and linear independence of the natural spanning words in TT, but the source gives no resolution of the conjecture.

References

Primary source

Kazumasa Nomura and Paul Terwilliger, “On the shape of a tridiagonal pair”, arXiv:0906.3838 (2009).

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.