Parking functions of types A and B (Q1599525)

A (type A) parking function is a sequence of positive integers \((a_1,\dots, a_n)\) such that its increasing re-arrangement \((b_1,\dots, b_n)\) satisfies \(b_i\leq i\). A (type B) parking function satisfies \(a_i\leq n\). Thus \((1,3,3)\) is of (type B) but not of (type A). A non-crossing partition of \([1,n]= (1,2,\dots,n)\) is a partition such that for no \(a< b< c< d\) do \(a\) and \(c\) belong to one block and \(b\) and \(d\) to some different block. \(\text{NC}_n\) is the lattice of non-crossing partitions of \([1,n]\) in the refinement order with Stanley's edge-labeling of \(\text{NC}_{n+1}\) providing a proof that maximal chains of \(\text{NC}_{n+1}\) are in one-one correspondence with (type A) parking functions. A non-crossing partition of \(\{-1,-2,-n,1,2,\dots, n\}\) under sign-change belongs to \(\text{NC}^B_N\). The author produces an alternative proof of Stanley's result via the natural embedding of \(\text{NC}_{n+1}\) in the Cayley graph of \(S_{n+1}\) and uses an analogous embedding of \(\text{NC}^B_N\) into the Cayley graph of \(W_n\), the hyper-octahedral group, to provide a parallel treatment of the (type B) case, and in both cases an elegant way to obtain the result given.