Add to ORKGInternational audienceWe introduce a large class of parking procedures on Z generalizing the classical one. This class is characterized by natural local constraints that the procedures must satisfy. We uncover some nice combinatorics attached to such procedures, including a certain universal enumeration formula
AbstractWe consider the inversion enumerator In(q), which counts labeled trees or, equivalently, par...
AbstractLet u be a sequence of non-decreasing positive integers. A u-parking function of length n is...
International audienceFor a fixed sequence of $n$ positive integers $(a,\bar{b}) := (a, b, b,\ldots,...
International audienceWe introduce a large class of parking procedures on Z generalizing the classic...
We introduce the class of bilateral parking procedures on the integers. These generalize the classic...
AbstractParking functions are central in many aspects of combinatorics. We define in this communicat...
The central topic of this thesis is parking functions. We give a survey of some of the current li...
AbstractParking functions on [n] = {1, …, n} are those functions p: [n] → [n] satisfying the conditi...
International audienceWe introduce a new approach to the enumeration of rational slope parking funct...
A parking function can be thought of as a sequence of n drivers, each with a preferred parking space...
AbstractWe describe an involution on a set of sequences associated with lattice paths with north or ...
Cette thèse se situe dans les domaines de la combinatoire algébrique, bijective et énumérative.Elle ...
Since their introduction by Konheim and Weiss, parking functions have evolved into objects of surpri...
This thesis comes within the scope of algebraic, bijective and enumerative combinatorics. It deals w...
Abstract. The Shi arrangement is the set of all hyperplanes in Rn of the form xj − xk = 0 or 1 for 1...
AbstractWe consider the inversion enumerator In(q), which counts labeled trees or, equivalently, par...
AbstractLet u be a sequence of non-decreasing positive integers. A u-parking function of length n is...
International audienceFor a fixed sequence of $n$ positive integers $(a,\bar{b}) := (a, b, b,\ldots,...
International audienceWe introduce a large class of parking procedures on Z generalizing the classic...
We introduce the class of bilateral parking procedures on the integers. These generalize the classic...
AbstractParking functions are central in many aspects of combinatorics. We define in this communicat...
The central topic of this thesis is parking functions. We give a survey of some of the current li...
AbstractParking functions on [n] = {1, …, n} are those functions p: [n] → [n] satisfying the conditi...
International audienceWe introduce a new approach to the enumeration of rational slope parking funct...
A parking function can be thought of as a sequence of n drivers, each with a preferred parking space...
AbstractWe describe an involution on a set of sequences associated with lattice paths with north or ...
Cette thèse se situe dans les domaines de la combinatoire algébrique, bijective et énumérative.Elle ...
Since their introduction by Konheim and Weiss, parking functions have evolved into objects of surpri...
This thesis comes within the scope of algebraic, bijective and enumerative combinatorics. It deals w...
Abstract. The Shi arrangement is the set of all hyperplanes in Rn of the form xj − xk = 0 or 1 for 1...
AbstractWe consider the inversion enumerator In(q), which counts labeled trees or, equivalently, par...
AbstractLet u be a sequence of non-decreasing positive integers. A u-parking function of length n is...
International audienceFor a fixed sequence of $n$ positive integers $(a,\bar{b}) := (a, b, b,\ldots,...