Equivalence of the two-sided dictionary and merger orders on Lusztig data
Equivalence of the two-sided dictionary and merger orders on Lusztig data
Let be the set of Lusztig data equipped with the two-sided dictionary partial order from the cited definition and the merger partial order from the cited definition. Equivalence conjecture. The partial order from the two-sided dictionary definition and the partial order from the merger definition are equivalent.
The claim compares two poset structures on Lusztig data. The supplied text gives no resolution status or further context about what the equivalence entails.
Sources & referencesView supporting material
Primary source
Ivan Balashov, Constantine Bulavenko and Yaroslav Molybog, “Tesler matrices and Lusztig data”, arXiv:2408.01513 (2024).
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.