Interval Parking Functions
Publication Date
11-16-2020
Document Type
Article
Organizational Units
College of Natural Science and Mathematics, Mathematics
Keywords
Interval parking functions, IPFs, Reachable permutations, Transitive closure, Pseudoreachability order, Armstrong's sorting order
Abstract
Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking function can be expressed as a pair (π,π), where a is a parking function and b is a dual parking function. We say that a pair of permutations (π₯,π¦) is reachable if there is an IPF (π,π) such that π₯,π¦ are the outcomes of π,π, respectively, as parking functions. Reachability is reflexive and antisymmetric, but not in general transitive. We prove that its transitive closure, the pseudoreachability order, is precisely the bubble-sorting order on the symmetric group ππ, which can be expressed in terms of the normal form of a permutation in the sense of du Cloux; in particular, it is isomorphic to the product of chains of lengths 2,β¦,π. It is thus seen to be a special case of Armstrong's sorting order, which lies between the Bruhat and (left) weak orders.
Copyright Date
11-16-2020
Copyright Statement / License for Reuse

All Rights Reserved.
Rights Holder
Elsevier Inc.
Provenance
Received from author
Language
English (eng)
Publication Statement
Copyright is held by Elsevier Inc. User is responsible for all copyright compliance.
Publication Title
Advances in Applied Mathematics
Volume
123
First Page
102129
ISSN
1090-2074
Recommended Citation
Colaric, E., DeMuse, R., Martin, J. L., & Yin, M. (2021). Interval parking functions. Advances in Applied Mathematics, 123, 102129. https://doi.org/10.1016/j.aam.2020.102129