相关论文: The Defective Parking Space and Defective Kreweras…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…
Let $N^{0}(m,n)$ be the number of odd Durfee symbols of $n$ with odd rank $m$, and $N^{0}(a,M;n)$ be the number of odd Durfee symbols of $n$ with odd rank congruent to $a$ modulo $M$. We give explicit formulas for the generating functions…
Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these…
We present a bijection between two well-known objects in the ubiquitous Catalan family: non-decreasing parking functions and {\L}ukasiewicz paths. This bijection maps the maximal displacement of a parking function to the height of the…
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 Lehmer parking functions and study their set of parking outcomes. Our main results establish that the number of outcomes of Lehmer parking functions of length $n$ is given by a Bell number, which is exactly the number of set…
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 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.
Any 4d theory possessing $\mathcal{N}=1$ supersymmetry admits a so called $\mathcal{S}$-multiplet, containing the conserved energy-momentum tensor and supercurrent. When a defect is introduced into such a theory, the $\mathcal{S}$-multiplet…
We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.
An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my. The set of these paths can be equipped with a lattice structure,…
In this paper we study the asymptotic behavior of a random uniform parking function $\pi_n$ of size $n$. We show that the first $k_n$ places $\pi_n(1),\dots,\pi_n(k_n)$ of $\pi_n$ are asymptotically i.i.d. and uniform on $\{1,2,\dots,n\}$,…
In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…
In $\mathcal L$, the semilattice of faces of an $n$-cube, we count the number of automorphisms of $\mathcal L$ that fix a given subalgebra -- either pointwise or as a subalgebra. By using M\"obius inversion we get a formula for the number…
While real-time parking slot detection plays a critical role in valet parking systems, existing methods have limited success in real-world applications. We argue two reasons accounting for the unsatisfactory performance: \romannumeral1, The…
The moduli space $\overline{M}_{0,n}$ may be embedded into the product of projective spaces $\mathbb{P}^1\times \mathbb{P}^2\times \cdots \times \mathbb{P}^{n-3}$, using a combination of the Kapranov map $|\psi_n|:\overline{M}_{0,n}\to…
In a parking function, a car is considered lucky if it is able to park in its preferred spot. Extending work of Harris and Martinez, we enumerate outcomes of parking functions with a fixed set of lucky cars. We then consider a…
Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model…
We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general…