Involution word tableau enumeration conjecture for type D
Let be the finite Coxeter group of signed permutations with an even number of negative letters, with longest element . For the identity automorphism, let denote the involution words with each occurrence of replaced by ; for the automorphism interchanging and and fixing for , let be defined analogously. Write
and
Involution word tableau enumeration conjecture. If , then
and
These are proposed analogues for twisted involution words of the known type D reduced-word enumeration by standard Young tableaux. The claim is presented as an apparent analogue and no resolution is supplied in the source.
References
2 papers in this index state this conjecture (2015–2018). The statement above is taken from the most recent of them; the others are arXiv:1508.01823.
Source: Eric Marberg and Brendan Pawlowski, “Stanley symmetric functions for signed involutions”, arXiv:1806.11208 (2019).
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
No solutions have been posted yet.