k-factorizations of the full cycle and generalized Mahonian statistics on k-forests

DOI10.1016/J.AAM.2023.102566MaRDI QIDQ6094845zbMATH OpenWikidataFDO

Authors J. Irving, Amarpreet Rattan

Publication date 14 September 2023

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2110.13906

zbMATH Keywords

labelled treesinversion enumeratorHaglund bounce statistic on parking functionsStanley function

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Exact enumeration problems, generating functions (05A15)

Abstract: We develop direct bijections between the set $F_n^k$ of minimal factorizations of the long cycle $(0,1,cdots,kn)$ into $(k+1)$-cycle factors and the set $R_n^k$ of rooted labelled forests on vertices $1,ldots,n$ with edges coloured with $0,1,ldots,k-1$ that map natural statistics on the former to generalized Mahonian statistics on the latter. In particular, we examine the generalized major index on forests $R_n^k$ and show that it has a simple and natural interpretation in the context of factorizations. Our results extend those by the present authors (2021), which treated the case $k=1$ through a different approach, and provide a bijective proof of the equidistribution observed by Yan (1997) between displacement of $k$-parking functions and generalized inversions of $k$-forests.

Recommendations

• Trees, parking functions and factorizations of full cycles
• Mahonian statistics on labeled forests
• The k-extension of a Mahonian statistic
• Generalized tree inversions and \(k\)-parking functions
• Sorting index and Mahonian-Stirling pairs for labeled forests

Cites work

• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• A refinement of Cayley's formula for trees
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• Generalized tree inversions and \(k\)-parking functions
• Mahonian statistics on labeled forests
• Minimal Transitive Factorizations of Permutations into Cycles
• Parking functions
• Parking functions and noncrossing partitions
• Parking functions of types A and B
• Sorting index and Mahonian-Stirling pairs for labeled forests
• The \(q,t\)-Catalan numbers and the space of diagonal harmonics. With an appendix on the combinatorics of Macdonald polynomials
• The inversion enumerator for labeled trees
• Tree-like properties of cycle factorizations
• Trees, parking functions and factorizations of full cycles
• Une famille de polynômes ayant plusieurs propriétés enumeratives
• k-indivisible noncrossing partitions
• q-hook length formulas for forests

Cited in

(1)

• Parking functions, tree depth and factorizations of the full cycle into transpositions

This page was built for publication: \(k\)-factorizations of the full cycle and generalized Mahonian statistics on \(k\)-forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094845)