The type-BC indifference graph equivalence conjecture for Kazhdan–Lusztig basis elements
The type-BC indifference graph equivalence conjecture for Kazhdan–Lusztig basis elements
Let avoid the patterns and . Write and for their type- indifference graphs, and let be the corresponding Kazhdan–Lusztig basis elements. For elements of , define when every trace has . The type-BC indifference graph conjecture. If , then
The corresponding implication at is known only in the reverse direction, so this strengthening remains open even for the indicated pattern-avoiding elements.
Sources & referencesView supporting material
Primary source
Mark Skandera, “Hyperoctahedral group characters and a type-BC analog of graph coloring”, arXiv:2402.04148 (2025).
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.