Related papers: Inversions in parking functions
In this short paper, we show how to deduce several types of generating functions from Srivastava {\it et al} [Appl. Set-Valued Anal. Optim. {\bf 1} (2019), pp. 187-201.] by the method of $q$-difference equations. Moreover, we build…
We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before…
We recall that unit interval parking functions of length $n$ are a subset of parking functions in which every car parks in its preference or in the spot after its preference, and Fubini rankings of length $n$ are rankings of $n$ competitors…
If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…
The main objective of this paper is to introduce the modified q-Genocchi polynomials and to define their generating function. In the paper, we show new relations, which are explicit formula, derivative formula, multiplication formula, and…
For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are…
In this paper, we mainly study two notions of pattern avoidance in parking functions. First, for any collection of length 3 patterns, we compute the number of parking functions of size $n$ that avoid them under the first notion. This is…
This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.
A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is challenging, especially for expressive languages that feature…
It has long been agreed by academics that the inversion method is the method of choice for generating random variates, given the availability of the quantile function. However for several probability distributions arising in practice a…
For words of length $n$, generated by independent geometric random variables, we consider the mean and variance of the number of inversions and of a parameter of Knuth from permutation in situ. In this way, $q$--analogues for these…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…
Warning. The reading of this paper will send you down many winding roads toward new and exciting research topics enumerating generalized parking functions. Buckle up!
This paper analyzes over 30 types of q-series and the asymptotic behavior of their expansions. A method is described for deriving further asymptotic formulas using convolutions of generating functions with subexponential growth. All…
In this paper, let $\mathcal{P}_{n,n+k;\leq n+k}$ (resp. $\mathcal{P}_{n;\leq s}$) denote the set of parking functions $\alpha=(a_1,...,a_n)$ of length $n$ with $n+k$ (respe. $n$)parking spaces satisfying $1\leq a_i\leq n+k$ (resp. $1\leq…
We compute the noncommutative Frobenius characteristic of the natural action of the 0-Hecke algebra on parking functions, and obtain as corollaries various forms of the noncommutative Lagrange inversion formula.
We give a formula for the bivariate generating function of a stationary 1-dependent counting process in terms of its run probability generating function, with a probabilistic proof. The formula reduces to the well known bivariate generating…
A parking function of length $n$ is a sequence $\pi=(\pi_1,\dots, \pi_n)$ of positive integers such that if $\lambda_1\leq\cdots\leq \lambda_n$ is the increasing rearrangement of $\pi_1,\dots,\pi_n$, then $\lambda_i\leq i$ for $1\leq i\leq…
Let $W$ be an irreducible finite complex reflection group acting on a complex vector space $V$. For a positive integer $k$, we consider a class function $\varphi_k$ given by $\varphi_k(w) = k^{\dim V^w}$ for $w \in W$, where $V^w$ is the…