Linear independence of zigzag words in the algebra T
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.