A decomposition of parking functions by undesired spaces

zbMATH Open1344.05019arXiv1602.02175MaRDI QIDQ311546FDOQ311546

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

Publication date: 13 September 2016

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

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.

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

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

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

zbMATH Keywords

parking functionsnoncrossing partitions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Parking functions and noncrossing partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• On the structure of the lattice of noncrossing partitions
• Some properties of crossings and partitions
• Title not available (Why is that?)
• A ``Fourier transform for multiplicative functions on non-crossing partitions

Cited In (6)

• The noncrossing bond poset of a graph
• Some properties of the parking function poset
• Parking functions of types A and B
• Nonhomogeneous parking functions and noncrossing partitions
• Two posets of noncrossing set partitions
• Undesired parking spaces and contractible pieces of the noncrossing partition link

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)