Some enumerative properties of parking functions

DOI10.5070/C65465679MaRDI QIDQ6847337zbMATH OpenFDO

Authors Richard P. Stanley, Mei Yin

Publication date 9 March 2026

Published in Combinatorial Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5070/C65465679

zbMATH Keywords

generating functionlabelled forestparking functionPollak's circle argumentrecurrence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial probability (60C05)

Cites work

• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• A refinement of Cayley's formula for trees
• An insertion algorithm and leaders of rooted trees
• An introduction to hyperplane arrangements
• An Occupancy Discipline and Applications
• Ballots and trees
• Generalizing parking functions with randomness
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Mappings of acyclic and parking functions
• Parking functions
• Parking functions and noncrossing partitions
• Parking functions: from combinatorics to probability
• Probabilistic parking functions
• Probabilizing parking functions
• Some aspects of (r,k)-parking functions
• The Shi arrangement and the Ish arrangement
• The Supremum and Infimum of the Poisson Process

This page was built for publication: Some enumerative properties of parking functions

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