A decomposition of parking functions by undesired spaces

MaRDI QIDQ311546zbMATH OpenFDO

Authors Melody Bruce, Michael Dougherty, Max Hlavacek, Ryo Kudo, Ian Nicolas

Publication date 13 September 2016

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.02175, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p32

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

noncrossing partitionsparking functions

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)

Abstract: There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable M"obius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.

Recommendations

• Parking functions and noncrossing partitions
• Some properties of the parking function poset
• Some properties of the parking function poset
• Parking functions of types A and B
• Two posets of noncrossing partitions coming from undesired parking spaces

Cites work

• A ``Fourier transform for multiplicative functions on non-crossing partitions
• scientific article; zbMATH DE number 3621813 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• On the structure of the lattice of noncrossing partitions
• Parking functions and noncrossing partitions
• Some properties of crossings and partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)

Cited in

(8)

• Nonhomogeneous parking functions and noncrossing partitions
• Parking functions of types A and B
• Two posets of noncrossing set partitions
• Undesired parking spaces and contractible pieces of the noncrossing partition link
• Some properties of the parking function poset
• Some properties of the parking function poset
• The noncrossing bond poset of a graph
• On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions

This page was built for publication: A decomposition of parking functions by undesired spaces

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