Related papers: Parking Spaces
For any irreducible real reflection group $W$ with Coxeter number $h$, Armstrong, Reiner, and the author introduced a pair of $W \times \ZZ_h$-modules which deserve to be called {\sf $W$-parking spaces} which generalize the type A notion of…
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…
Let $W$ be an irreducible finite complex reflection group acting on a complex vector space $V$. For a positive integer $k$, we consider a class function $\varphi_k$ given by $\varphi_k(w) = k^{\dim V^w}$ for $w \in W$, where $V^w$ is the…
Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$, coroot lattice $\check{Q}$ and Coxeter number $h$. Recently the second named author defined a uniform $W$-isomorphism $\zeta$ between the finite torus…
Armstrong, Reiner, and Rhoades defined for all Weyl groups $W$ a natural representation of $W$ called the $W$-parking space. The type $B$ parking space is the representation $\mathbb{C}[(\mathbb{Z}/(2n+1)\mathbb{Z})^n]$ of the $n$th signed…
We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations…
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…
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…
The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…
Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…
A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its…
We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has…
Local Weyl modules over two-dimensional currents with values in $gl_r$ are deformed into spaces with bases related to parking functions. Using this construction we 1) propose a simple proof that dimension of the space of diagonal…
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.
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more…