Two t-analogues of the tree inversion enumerator
classification
🧮 math.CO
keywords
analoguesdifferentenumeratorinversiontreewidetildealternatingalthough
read the original abstract
In this note, we introduce two $t$-analogues $I_n(q,t)$ and $\widetilde{I}_n(q,t)$ of the tree inversion enumerator $I_n(q)$. Although similar, $I_n(q,t)$ and $\widetilde{I}_n(q,t)$ are different. But they both seem to have interesting properties. In particular, we conjecture that their $q=-1$ specializations give two different, natural refinements of the zigzag numbers counting alternating permutations.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Short Proofs in Algebraic and Enumerative Combinatorics
AI-generated short proofs resolve multiple open conjectures in combinatorics.
-
Short Proofs in Algebraic and Enumerative Combinatorics
Short AI-generated proofs resolve open conjectures on echelonmotion operators, parking function statistics, and plactic monoid centralizers.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.