The involution-word bumping conjecture for queer supercrystals
The involution-word bumping conjecture for queer supercrystals
Let denote the set of involutions in the infinite symmetric group, let be an involution word, and let be the involution-word bumping operator. Suppose
Involution-word bumping conjecture. For every , one has .
Computations support this analogue of the corresponding result for Edelman–Greene insertion; if true, it would immediately prove the most difficult part of the stated theorem on the orthogonal insertion algorithm. The conjecture is presented as open in the source.
Sources & referencesView supporting material
Primary source
Eric Marberg, “Bumping operators and insertion algorithms for queer supercrystals”, arXiv:1910.02261 (2021).
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.