Related papers: Parking functions and triangulation of the associa…
A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…
We give a bijective proof of the fact that the number of k-prefixes of minimal factorisations of the n-cycle (1...n) as a product of n-1 transpositions is n^{k-1}\binom{n}{k+1}. Rather than a bijection, we construct a surjection with fibres…
We propose a simple formula for the coordinates of the vertices of the Stasheff polytope (associahedron) and we compare it to the permutohedron.
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
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…
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…
If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
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…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also…
Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of $n$ vertices (parking spots)…
A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1)^{n-1}$. This…
Scattering amplitudes of $\operatorname{tr}(\phi^3)$ theory can be encoded as the canonical form of the Stasheff associahedron. Similarly, the flat-space wavefunction coefficients of the same theory are captured by the recently proposed…
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…
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…
We realize Stasheff's multiplihedron geometrically as the moduli space of stable quilted disks. This generalizes the geometric realization of the associahedron as the moduli space of stable disks. We show that this moduli space is the…
In a remarkable recent work [arXiv : 1711.09102] by Arkani-Hamed et al, the amplituhedron program was extended to the realm of non-supersymmetric scattering amplitudes. In particular it was shown that for tree-level planar diagrams in…
We introduce a generalization of parking functions called $t$-metered $(m,n)$-parking functions, in which one of $m$ cars parks among $n$ spots per hour then leaves after $t$ hours. We characterize and enumerate these sequences for $t=1$,…
This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schr\"oder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over…