Related papers: On vector parking functions and q-analogue

We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit…

Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous spots, before proceeding forward as usual. In this work…

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}$.…

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 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…

Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…

The classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…

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…

We enumerate a class of fully parked trees. In a probabilistic context, this means computing the partition function $F(x,y)$ of the parking process where an i.i.d. number of cars arrives at each vertex of a Galton-Watson tree with a…

Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$, coroot lattice $\check{Q}$ and Coxeter number $h$. Recently the second named author defined a uniform $W$-isomorphism $\zeta$ between the finite torus…

Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects…

Multiple types can represent the same concept. For example, lists and trees can both represent sets. Unfortunately, this easily leads to incomplete libraries: some set-operations may only be available on lists, others only on trees.…

Armstrong, Reiner, and Rhoades defined for all Weyl groups $W$ a natural representation of $W$ called the $W$-parking space. The type $B$ parking space is the representation $\mathbb{C}[(\mathbb{Z}/(2n+1)\mathbb{Z})^n]$ of the $n$th signed…

This paper is a short overview of the main Abelian- and Tauberian-type results from [4, 14, 26] regarding the asymptotic analysis of different classes of generalized functions in terms of appropriate frames. The Tauberian-type results…

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Vector-space representations provide geometric tools for reasoning about the similarity of a set of objects and their relationships. Recent machine learning methods for deriving vector-space embeddings of words (e.g., word2vec) have…

To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…

The human ability to flexibly reason using analogies with domain-general content depends on mechanisms for identifying relations between concepts, and for mapping concepts and their relations across analogs. Building on a recent model of…

We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of…

Let $A$ be a centrally closed prime algebra over a characteristic 0 field $k$, and let $q:A\to A$ be the trace of a $d$-linear map (i.e., $q(x)=M(x,...,x)$ where $M:A^d\to A$ is a $d$-linear map). If $[q(x),x]=0$ for every $x\in A$, then…