(\mathfrak{S}_p \times \mathfrak{S}_q)-Invariant Graphical Parking Functions

MaRDI QIDQ6435529FDO

Authors Lauren Snider, Catherine Yan

Publication date 5 May 2023

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Abstract: 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 between $G$-parking functions and another vector-dependent generalization of parking functions, the $$-parking functions. The crucial component of their result was their classification of all graphs $G$ whose $G$-parking functions are invariant under action by the symmetric group $mathfrak{S}_n$, where $n+1$ is the order of $G$. In this work, we present a 2-dimensional analogue of Gaydarov and Hopkins' results by characterizing the overlap between $G$-parking functions and 2-dimensional $$-parking functions, i.e., pairs of integer sequences whose order statistics are bounded by certain weights along lattice paths in the plane. Our key result is a total classification of all $G$ whose set of $G$-parking functions is $(mathfrak{S}_{p}imesmathfrak{S}_q)$-invariant, where $p+q+1$ is the order of $G$.

This page was built for publication: ($\mathfrak{S}_p \times \mathfrak{S}_q$)-Invariant Graphical Parking Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435529)