← All problems

Involution word tableau enumeration conjecture for type D

11 years old · traced to

Let DnD_n be the finite Coxeter group of signed permutations with an even number of negative letters, with longest element wnDw_n^D. For the identity automorphism, let R^‾(wnD)\underline{\hat{\mathcal{R}}}(w_n^D) denote the involution words with each occurrence of t1′t_1' replaced by t1t_1; for the automorphism ∗* interchanging t1t_1 and t1′t_1' and fixing tit_i for i∈[2,n−1]i\in[2,n-1], let R^‾∗(wnD)\underline{\hat{\mathcal{R}}}_*(w_n^D) be defined analogously. Write

λ=(n−1,n−2,…,⌊n/2⌋,⌊n/2⌋,…,2,1)\lambda=(n-1,n-2,\ldots,\lfloor n/2\rfloor,\lfloor n/2\rfloor,\ldots,2,1)

and

μ=(n−1,n−2,…,⌈n/2⌉−1,⌈n/2⌉−1,…,2,1).\mu=(n-1,n-2,\ldots,\lceil n/2\rceil-1,\lceil n/2\rceil-1,\ldots,2,1).

Involution word tableau enumeration conjecture. If n≥3n\geq 3, then

∣R^‾(wnD)∣=∣SYT⁡(λ)∣\left|\underline{\hat{\mathcal{R}}}(w_n^D)\right|=|\operatorname{SYT}(\lambda)|

and

∣R^‾∗(wnD)∣=∣SYT⁡(μ)∣.\left|\underline{\hat{\mathcal{R}}}_*(w_n^D)\right|=|\operatorname{SYT}(\mu)|.

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

Never refreshed

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.