Related papers: Parking cars after a trailer

The shuffle conjecture expresses a relationship between parking functions, diagonal harmonics, and the Bergeron-Garsia $\nabla$ operator. Recent conjectures about a family of modified Hall-Littlewood operators made by Haglund, Morse, and…

Let $(A_u : u \in \mathbb{B})$ be i.i.d.~non-negative integers that we interpret as car arrivals on the vertices of the full binary tree $ \mathbb{B}$. Each car tries to park on its arrival node, but if it is already occupied, it drives…

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…

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…

In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…

We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…

This paper considers the problem of inference after ranking. In our setting, we are interested in any population whose rank according to some random quantity, such as an estimated treatment effect, a measure of value-added, or benefit (net…

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

In this expository article I describe classical results in the combinatorics of parking functions. Its English-Spanish translation is included. -- -- En este art\'iculo de difusi\'on matem\'atica describo resultados cl\'asicos en la…

We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…

In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios between two genomes. This problem is related to the uniform generation of rearrangement scenarios, and the…

Platooning of vehicles is a promising approach for reducing fuel consumption, increasing vehicle safety, and using road space more efficiently. We consider the important but difficult problem of assigning optimal routes and departure…

Kreweras proved that the reversed sum enumerator for parking functions of length $n$ is equal to the inversion enumerator for labeled trees on $n+1$ vertices. Recently, Perkinson, Yang, and Yu gave a bijective proof of this equality that…

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…

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,…

Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous spots, before proceeding forward as usual. In this work…

While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…

Christol's theorem states that a power series with coefficients in a finite field is algebraic if and only if its coefficient sequence is automatic. A natural question is how the size of a polynomial describing such a sequence relates to…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…