Posets, parking functions and the regions of the Shi arrangement revisited
Abstract: The number of regions of the type A_{n-1} Shi arrangement in Rn is counted by the intrinsically beautiful formula (n+1){n-1}. First proved by Shi, this result motivated Pak and Stanley as well as Athanasiadis and Linusson to provide bijective proofs. We give a description of the Athanasiadis-Linusson bijection and generalize it to a bijection between the regions of the type C_n Shi arrangement in Rn and sequences a_1a_2...a_n, where a_i \in {-n, -n+1,..., -1, 0, 1,..., n-1, n}, i \in [n]. Our bijections naturally restrict to bijections between regions of the arrangements with a certain number of ceilings (or floors) and sequences with a given number of distinct elements. A special family of posets, whose antichains encode the regions of the arrangements, play a central role in our approach.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.