Related papers: Parking functions with zero secondary dinv
We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…
In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…
We study a variant of the R\'enyi parking problem in which car length is repeatedly halved and determine the rate at which the remaining space decays.
An asymmetric exclusion process type process, where cars move forward along a closed road that starts and terminates at a parking garage, displays dynamic phase transitions into two types of condensate phases where the garage becomes…
In this paper, we introduce a new method for computing generating functions with respect to the number of descents and left-to-right minima over the set of permutations which have no consecutive occurrences of a pattern that starts with 1.
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions.…
We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…
We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]
We consider transcendental entire functions of finite order for which the zeros and $1$-points are in disjoint sectors. Under suitable hypotheses on the sizes of these sectors we show that such functions must have a specific form, or that…
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 find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…
We show that if a permutation $\pi$ contains two intervals of length 2, where one interval is an ascent and the other a descent, then the M\"{o}bius function $\mu[\pi]$ of the interval $[1,\pi]$ is zero. As a consequence, we show that the…
The paper determines all meromorphic functions with finitely many zeros in the plane having the property that a linear differential polynomial in the function, of order at least 3 and with rational functions as coefficients, also has…
We compute the motivic nearby cycles of functions obtained by composition with a polynomial which is non-degenerate with respect to its Newton polyhedron. Our result involves new convolution operators and generalized nearby cycles.
We extend previous work on conformally covariant differential operators to consider the case of second order operators acting on symmetric traceless tensor fields. The corresponding flat space Green function is explicitly constructed and…
The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c,f) with p…
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…