Some statistics for Fibonacci tableaux (Q1024287): Difference between revisions

A famous theorem of MacMahon states that the inversion statistic \(\text{inv}(\pi)\) and major index \(\text{maj}(\pi)\) of a permutation \(\pi\) are equidistributed: \(\sum_{\pi\in S_n}q^{\text{maj}(\pi)}=\sum_{\pi\in S_n}q^{\text{inv}(\pi)}\). In this paper the author defines several statistics for \textit{Fibonacci tableaux} based on known statistics for permutations, and proves an analogue of MacMahon's theorem (Theorem 2). A key step is to define the notion of a \textit{Fibonacci permutation}, and to observe that there is a one-to-one correspondence between Fibonacci permutations and standard Fibonacci tableaux. Then for any standard Fibonacci tableau \(T\), the notions of \textit{inversion} statistic \(\text{inv}(T)\) and \textit{inverse major index} \(\text{imaj}(T)\) can be defined in terms of the corresponding Fibonacci permutation. The main result states that \(\sum_{T}q^{\text{imaj}(T)}=\sum_{T}q^{\text{inv}(T)}\), where the sum is taken over all standard Fibonacci tableaux \(T\) of a given shape \(\mu\). The author emphasises that it is the connection to the Fibonacci tableaux that is new, not the corresponding result for the underlying permutations. The article is clearly written, and includes examples which illustrate important definitions and algorithms.