Generalized parking functions, descent numbers, and chain polytopes of ribbon posets

DOI10.1016/j.aam.2009.02.004zbMath1230.05042arXiv0806.0440OpenAlexW2083034325MaRDI QIDQ846219

Denis Chebikin, Alexander Postnikov

Publication date: 2 February 2010

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

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

zbMATH Keywords

labeled treesparking functionschain polytopesdescent sets of permutationsribbon posetstree inversions

Mathematics Subject Classification ID

Trees (05C05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial identities, bijective combinatorics (05A19) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Probabilizing parking functions ⋮ Parking functions and tree inversions revisited ⋮ Parking Cars of Different Sizes ⋮ Asymptotic behaviour of the first positions of uniform parking functions ⋮ Parking cars after a trailer ⋮ Random doubly stochastic tridiagonal matrices

Cites Work

• Unnamed Item
• Chains in the Bruhat order
• Two poset polytopes
• Une famille de polynômes ayant plusieurs propriétés enumeratives
• Nombres d'Euler et inversions dans les arbres
• A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
• Gončarov polynomials and parking functions
• Resolutions for \(S_ n\)-modules, associated with rim hooks, and combinatorial applications
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• Generalized parking functions, tree inversions, and multicolored graphs

This page was built for publication: Generalized parking functions, descent numbers, and chain polytopes of ribbon posets