Related papers: What is a Parking Function?
Parking functions were classically defined for $n$ cars attempting to park on a one-way street with $n$ parking spots, where cars only drive forward. Subsequently, parking functions have been generalized in various ways, including allowing…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…
Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…
Field-theoretic construction of functional representations of solutions of stochastic differential equations and master equations is reviewed. A generic expression for the generating function of Green functions of stochastic systems is put…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…
In this paper, let $\mathcal{P}_{n,n+k;\leq n+k}$ (resp. $\mathcal{P}_{n;\leq s}$) denote the set of parking functions $\alpha=(a_1,...,a_n)$ of length $n$ with $n+k$ (respe. $n$)parking spaces satisfying $1\leq a_i\leq n+k$ (resp. $1\leq…
Unit-interval parking functions are subset of parking functions in which cars park at most one spot away from their preferred parking spot. In this paper, we characterize unit-interval parking functions by understanding how they decompose…
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…
In 1980, G. Kreweras gave a recursive bijection between forests and parking functions. In this paper we construct a nonrecursive bijection from forests onto parking functions, which answers a question raised by R. Stanley. As a by-product,…
This is a pedagogical review on polarized structure functions .
The aim of this work is to extend to a general $S_m\times S_n$-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a $m\times n$-rectangle. We obtain an explicit formula for the the "bi-Frobenius"…
In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…
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$-{\sf parking functions}, and we call the permutation representation of $W$ on the set of $W$-parking…
The goal of this Section is to formulate some of the basic results on the theory of integral equations and mention some of its applications. The literature of this subject is very large. Proofs are not given due to the space restriction.…
The purpose of this work is to introduce a general class of $C_G$-simulation functions and obtained some new coincidence and common fixed points results in metric spaces. Some useful examples are presented to illustrate our theorems.…
There are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…