Abstract
The Shi arrangement is the set of all hyperplanes in ℝn of the form xj − xk = 0 or 1 for 1 ≤ j < k ≤ n. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this arrangement is (n + 1)n−1. An unrelated combinatorial concept is that of a parking function, i.e., a sequence (x1, x2, …, xn) of positive integers that, when rearranged from smallest to largest, satisfies xk ≤ k. (There is an illustrative reason for the term parking function.) It turns out that the number of parking functions of length n also equals (n + 1)n−1, a result given by Konheim and Weiss in 1966. A natural problem consists of finding a bijection between the n-dimensional Shi arrangement and the parking functions of length n. Pak and Stanley (1996) and Athanasiadis and Linusson (1999) gave such (quite different) bijections. We will shed new light on the former bijection by taking a scenic route through certain mixed graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.