Related papers: Parking cars after a trailer
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
Let $\Delta$ be an integer $n \times n$-matrix which satisfies the conditions: $\det \Delta\neq 0$, $\Delta_{ij}\leq 0\text{ for }i\neq j,$ and there exists a vector ${\bf r}=(r_1,\ldots,r_n)>0$ such that ${\bf r}\Delta \geq 0$. Here the…
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…
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity…
We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity, which generalizes a result of Brillhart, Lomont and Morton on the Rudin--Shapiro polynomials. We study the…
We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…
An analogue of Taylor's formula, which arises by substituting the classical derivative by a divided difference operator of Askey-Wilson type, is developed here. We study the convergence of the associated Taylor series. Our results…
The action of the symmetric group $S_n$ on the set $Park_n$ of parking functions of size $n$ has received a great deal of attention in algebraic combinatorics. We prove that the action of $S_n$ on $Park_n$ extends to an action of $S_{n+1}$.…
The parking issue is central in transport policies and drivers' concerns, but the determinants of the parking search time remain relatively poorly understood. The question is often handled in a fairly ad hoc way, or by resorting to crude…
In this paper, we investigate a parking process on a uniform random rooted plane tree with $n$ vertices. Every vertex of the tree has a parking space for a single car. Cars arrive at independent uniformly random vertices of the tree. If the…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We continue the study of parking assortments, a generalization of parking functions introduced by Chen, Harris, Mart\'{i}nez, Pab\'{o}n-Cancel, and Sargent. Given $n$ cars of lengths $\mathbf{y}=(y_1,y_2,\dots,y_n) \in \mathbb{N}^n$, we…
We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…
We show that the spacing distribution between parked cars can be obtained as a solution of certain linear distributional fixed point equation. The results are compared with the data measured on the streets of Hradec Kralove. We also discuss…
Using measured data we demonstrate that there is an amazing correspondence among the statistical properties of spacings between parked cars and the distances between birds perching on a power line. We show that this observation is easily…