The symmetric Theta Conjecture for rooted trees with a prescribed root label

Let nn be a positive integer, let RTTj(1n+1) \mathsf{RTT}_j(1^{n+1}) denote the set of standard fully tiered rooted trees on n+1n+1 vertices whose root is labelled jj, and let inv(T) \mathsf{inv}(T) be their inversion statistic. Symmetric \Theta Conjecture. For 1jn1\leq j\leq n,

Θe1j1Δe1Θe1nje1,e1nt=1=TRTTj(1n+1)qinv(T).\left. \left\langle \Theta_{e_1^{j-1}} \Delta_{e_1} \Theta_{e_1^{n-j}} e_1,e_1^n \right\rangle \right\rvert_{t=1}=\sum_{T\in\mathsf{RTT}_j(1^{n+1})}q^{\mathsf{inv}(T)}.

This refines the preceding Theta Conjecture by separating the contribution according to the label of the root. The source motivates it using a decomposition of Θe1ne1 \Theta_{e_1^n}e_1 and gives no proof; the conjecture remains open.

Sources & referencesView supporting material

Primary source

Michele D'Adderio, Alessandro Iraci, Yvan LeBorgne, Marino Romero and Anna Vanden Wyngaerd, “Tiered trees and Theta operators”, arXiv:2202.05706 (2022).

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.