Almost h-positivity conjecture for rank-selected subword-order homology

From papers

Let AA be an alphabet of size n2n\ge 2, and let SnS_n act on AA^* by permuting the alphabet. A rank-selected subposet is obtained by retaining words whose ranks belong to a finite nonempty set. Let S(n1,1)S_{(n-1,1)} be the reflection representation of SnS_n, and set T2(n)={hλ:λ=(nr,1r), r2}T_2(n)=\{h_\lambda: \lambda=(n-r,1^r),\ r\ge 2\}. Almost h-positivity conjecture. The homology of any finite nonempty rank-selected subposet of subword order on AA^*, plus or minus one copy of S(n1,1)S_{(n-1,1)}, is a permutation module. Its Frobenius characteristic is hh-positive and supported on T2(n)T_2(n).

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Sheila Sundaram, “The reflection representation in the homology of subword order”, arXiv:2006.13367 (2021).

Solutions 0

No solutions have been posted yet.