Related papers: Parking Spaces for Complex Reflection Groups

We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.

Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking function can be expressed as a pair $(a,b)$, where $a$ is a…

When W is a finite reflection group, the noncrossing partition lattice NCP_W of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case)…

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

After having established elementary results on the relationship between a finite complex (pseudo-)reflection group W < GL(V) and its reflection arrangement A, we prove that the action of W on A is canonically related with other natural…

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…

We study the nonexpansivity of reflection mappings in geodesic spaces and apply our findings to the averaged alternating reflection algorithm employed in solving the convex feasibility problem for two sets in a nonlinear context. We show…

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…

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

The action of the symmetric group $S_n$ on the set $Park_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics. We prove that the action of $S_n$ on $Park_n$ extends to an action of $S_{n+1}$.…

We introduce deformations of the space of (multi-diagonal) harmonic polynomials for any finite complex reflection group of the form W=G(m,p,n), and give supporting evidence that this space seems to always be isomorphic, as a graded…

The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this…

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…

For $\mathbf{b}=(b_1,\dots,b_n)\in \mathbb{Z}_{>0}^n$, a $\mathbf{b}$-parking function is defined to be a sequence $(\beta_1,\dots,\beta_n)$ of positive integers whose nondecreasing rearrangement $\beta'_1\leq \beta'_2\leq \cdots \leq…

Whittaker functions are special functions that arise in $p$-adic number theory and representation theory. They may be defined on representations of reductive groups as well as their metaplectic covering groups: fascinatingly, many of their…

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…

The category of crossed complexes gives an algebraic model of CW-complexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to…

We study automorphisms $\alpha$ of a totally disconnected, locally compact group $G$ which are expansive in the sense that, for some identity neighbourhood $U$, the sets $\alpha^n(U)$ (for integers $n$) intersect in the trivial group.…