Related papers: Trimming the permutahedron to extend the parking s…

A modification of the usual extended N = 2 supersymmetry algebra implementing the two dimensional permutation group is performed. It is shown that one can found a multiplet that forms an off-shell realization of this alternative extension…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

Stanley recently introduced the shifted parking function symmetric function $SH_n$, which is the shiftification of Haiman's parking function symmetric function $PF_n$. The function $SH_n$ lives in the subalgebra of symmetric functions…

We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are $n\in\mathbb{N}$ cars of lengths $\mathbf{y}=(y_1,y_2,\ldots,y_n)\in\mathbb{N}^n$ entering a one-way street…

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

A parking function is a sequence of N nonnegative integers majorated by a permutation of the set {0, ..., N-1}. We provide a way to encode parking functions by data suggested by J.Haglund and N.Loehr. This coding is compared with another…

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…

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…

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…

We give a recursive definition of generalized parking function that allows us to view them as a species. From there we compute a non-commutative characteristic of the generalized parking function module, and deduce some enumeration formulas…

An \emph{$(r,k)$-parking function} of length $n$ may be defined as a sequence $(a_1,\dots,a_n)$ of positive integers whose increasing rearrangement $b_1\leq\cdots\leq b_n$ satisfies $b_i\leq k+(i-1)r$. The case $r=k=1$ corresponds to…

For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the…

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

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.

We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

Ceballos and Pons introduced the $s$-weak order on $s$-decreasing trees, for any weak composition $s$. They proved that it has a lattice structure and further conjectured that it can be realized as the $1$-skeleton of a polyhedral…

We establish upper and lower bounds on the dimension of the space spanned by the symmetric powers of the natural character of generalised symmetric groups. We adapt the methods of Savitt and Stanley from their paper `A note on the symmetric…

A parking function on $[n]$ creates a permutation in $S_n$ via the order in which the $n$ cars appear in the $n$ parking spaces. Placing the uniform probability measure on the set of parking functions on $[n]$ induces a probability measure…