Lauren Snider , Catherine Yan
Frontiers of Mathematics ›› : 1 -31.
Graphical parking functions, or G-parking functions, are a generalization of classical parking functions that depend on a connected multigraph G with a distinguished root vertex. Gaydarov and Hopkins established a connection between G-parking functions and a vector-dependent generalization of parking functions known as u-parking functions. The central component of their result was the classification of all graphs G for which the set of G-parking functions is invariant under the action of the symmetric group
G-parking functions / 2-dimensional parking functions / action of symmetric group / acyclic orientations / 05C57 / 05A05 / 05E18
| [1] |
Adeniran A., Snider L., Yan C., Multivariate difference Gončarov polynomials. Integers, 2021, 21A: Paper No. A1, 21 pp. |
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
Lefèvre C., Picard P., Abel–Gontcharoff polynomials, parking trajectories and ruin probabilities. Depend. Model., 2023, 11(1): Paper No. 20230107, 17 pp. |
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
Snider L., Yan C., U-parking functions and (p, q)-parking functions. Adv. in Appl. Math., 2022, 134: Paper No. 102309, 28 pp. |
| [18] |
Snider L., Yan C., $({\frak{S}}_{p}\times{\frak{S}}_{q})$-invariant graphical parking functions. 2025, arXiv:2305. 03651 |
| [19] |
|
| [20] |
|
Peking University
/
| 〈 |
|
〉 |