Related papers: Cluster parking functions

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…

A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…

Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…

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…

A global representation is a compatible collection of representations of the outer automorphism groups of the groups belonging to some collection of finite groups $\mathscr{U}$. Global representations assemble into an abelian category…

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…

We give a recursive definition of generalized parking function that allows us to view them as a species. From there we compute a non-commutative characteristic of the generalized parking function module, and deduce some enumeration formulas…

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…

This is a survey. The main subject of this survey is the homotopical or homological nature of certain structures which appear in classical problems about groups, Lie rings and group rings. It is well known that the (generalized) dimension…

Given a positive-integer-valued vector $u=(u_1, \dots, u_m)$ with $u_1<\cdots<u_m$. A $u$-parking function of length $m$ is a sequence $\pi=(\pi_1, \dots, \pi_m)$ of positive integers whose non-decreasing rearrangement $(\lambda_1, \dots,…

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…

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 show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.

Parking functions are tuples that describe the parking of $M$ cars on a street with $M$ parking spots. In this paper, we define exact $k$-typed parking functions ($k$-TPFs) to be a variant of classical parking functions. We then establish…

Clustering functional data is a challenging task due to intrinsic infinite-dimensionality and the need for stable, data-adaptive partitioning. In this work, we propose a clustering framework based on Random Projections, which simultaneously…

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.

We explore the link between combinatorics and probability generated by the question "What does a random parking function look like?" This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It…

We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.

Let P be a closed triangulated manifold, dim P=n. We consider the group of simplicial 1-chains C_1(P) and the homology group H_1(P). We also use some nonnegative weighting function L on C_1(P). For any homological class from H_1(P) method…