The notion of parking functions was introduced by Konheim and Weiss [53] as a colorful way
to describe their work on computer storage. The parking problem can be stated as follows …

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-parking functions, and we call the permutation …

We introduce a new approach to the enumeration of rational slope parking functions with
respect to the $\operatorname {area} $ and a generalized $\operatorname {dinv} $ statistics …

Enumerative combinatorics is about counting. The typical question is to find the number of
objects with a given set of properties. However, enumerative combinatorics is not just about …

We establish general counting formulas and bijections for deformations of the braid
arrangement. Precisely, we consider real hyperplane arrangements such that all the …

Given an arbitrary Coxeter system (W, S) (W,S) and a non‐negative integer mm, the mm‐Shi
arrangement of (W, S) (W,S) is a subarrangement of the Coxeter hyperplane arrangement of …

We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of
its regions are the parking functions of a closely related graph, thus proving conjectures of …

In 2003, Haglund's {\sf bounce} statistic gave the first combinatorial interpretation of the $ q, t
$-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a …

A special case of Haimanʼs identity [M. Haiman, Vanishing theorems and character
formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] for …

This paper primary investigates a specific type of deformation of the braid arrangement
$\mathcal {B} _n $ in $\mathbb {R}^ n $, which is the set $\mathcal {B} _n^ A $ of the …