Related papers: On $q$-Counting of Noncrossing Chains and Parking …

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…

Let $W$ be a Weyl group with root lattice $Q$ and Coxeter number $h$. The elements of the finite torus $Q/(h+1)Q$ are called the $W$-{\sf parking functions}, and we call the permutation representation of $W$ on the set of $W$-parking…

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…

A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…

Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…

We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…

This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.

For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are…

The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…

We determine the rank generating function, the zeta polynomial and the Moebius function for the poset NC^B(p,q) of annular non-crossing partitions of type B, where p and q are two positive integers. We give an alternative treatment of some…

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…

In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…

We settle a conjecture of B\'ona regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by…

Solomon showed that the Poincar\'e polynomial of a Coxeter group $W$ satisfies a product decomposition depending on the exponents of $W$. This polynomial coincides with the rank-generating function of the poset of regions of the underlying…

We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…

We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…

We express the toric g-vector entries of any simple polytope as a nonnegative integer linear combination of its gamma-vector entries. We show that the toric g-vector of the associahedron is the ascent statistic of 123-avoiding parking…