The inverse descent-class commutation conjecture for fine sets

Let BSn{\mathcal B}\subset {\mathcal S}_n be a fine set, and let J[n1]J\subseteq [n-1]. Write Dn,J1D_{n,J}^{-1} for the inverse descent class indexed by JJ, and let Q{\mathcal Q} denote the associated symmetric-function character. A multiset is fine when its associated character is represented by its quasisymmetric generating function as in the paper.

Inverse descent-class commutation conjecture. For every fine set BSn{\mathcal B}\subset {\mathcal S}_n and every J[n1]J\subseteq [n-1],

Q(Dn,J1B)=Q(BDn,J1).{\mathcal Q}(D_{n,J}^{-1}{\mathcal B})={\mathcal Q}({\mathcal B}D_{n,J}^{-1}).

In particular, the multiset Dn,J1BD_{n,J}^{-1}{\mathcal B} is fine.

The conjecture concerns multiset products of fine sets with inverse descent classes and is supported by computer experiments. The stated consequence follows from the paper's main result on products with inverse descent classes; the general equality remains open.

Sources & referencesView supporting material

Primary source

Sergi Elizalde and Yuval Roichman, “Schur-positive sets of permutations via products of grid classes”, arXiv:1509.00045 (2016).

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.