Related papers: Counting $k$-Naples parking functions through perm…
We construct an action of the braid group on $n$ strands on the set of parking functions of $n$ cars such that elementary braids have orbits of length 2 or 3. The construction is motivated by a theorem of Lyashko and Looijenga stating that…
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…
We introduce the notion of $k$-regular factorizations for contractions into $k$ factors, generalizing the classical notion of regular factorization due to Sz.-Nagy and Foia\c{s}, and develop a systematic framework for their analysis. Using…
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…
We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
Let $\mathfrak{S}_n$ denote the symmetric group and let $W(\mathfrak{S}_n)$ denote the weak order of $\mathfrak{S}_n$. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a…
Two measurements are employed to quantitatively investigate the scaling properties of the spatial distribution of urban facilities, the K function by number counting and the variance-mean relationship with the method of expanding bins. The…
Parking plays a central role in transport policies and has wide-ranging consequences: While the average time spent searching for parking exceeds dozens of hours per driver every year in many Western cities, the associated cruising traffic…
In an exercise in the first volume of his famous series of books, Knuth considered sorting permutations by passing them through a stack. Many variations of this exercise have since been considered, including allowing multiple passes through…
Many studies suggest that searching for parking is associated with significant direct and indirect costs. Therefore, it is appealing to reduce the time which car drivers spend on finding an available parking lot, especially in urban areas…
It is shown that there is a second properly normalized KNO scaling function, $nP_n(n/\bar n)=\varphi(z)$, which has certain advantages in the analysis of KNO scaling. First, the $nP_n$ are not influenced by the statistical and systematic…
Park-and-ride facilities are car parks where users can transfer to public transportation. Commuters can use P&R facilities or choose to travel by car to their destinations, and individual choice behavior is assumed to follow a logit model.…
We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regions of the Shi arrangement of type C, encoded as diagonally…
Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…
Minimal perfect hashing is the problem of mapping a static set of $n$ distinct keys into the address space $\{1,\ldots,n\}$ bijectively. It is well-known that $n\log_2(e)$ bits are necessary to specify a minimal perfect hash function (MPHF)…
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,…
We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…
The K function and its related statistics have been an enduring tool in the analysis of spatial point processes, providing an easy to compute and interpret summary statistic for characterising the interactions between points of one type, or…
We implement a double stochastic process as the mathematical model for the spatial point patterns of urban facilities. We find that the model with power covariance function can produce the best fit not only to $K$ function (whose derivative…