Options
Chip-Firing on the Complete Split Graph: Motzkin Words and Tiered Parking Functions
Author(s)
Date Issued
2021-09-10
Date Available
2024-05-20T10:03:19Z
Abstract
We highlight some results from studying chip-firing on the the complete split graph [5]. In this work it is shown that recurrent states can be characterised in terms of Motzkin words and can also be characterised in terms of a new type of parking function that we call a tiered parking function. These new parking functions arise by assigning a tier (or colour) to each of the cars, and specifying how many cars of a lower-tier one wishes to have parked before them.
Type of Material
Conference Publication
Publisher
Springer
Language
English
Status of Item
Peer reviewed
Journal
Extended Abstracts EuroComb 2021 European Conference on Combinatorics, Graph Theory and Applications, Proceedings
Conference Details
EuroComb 2021: Online European Conference on Combinatorics, Graph Theory and Applications, Barcelona, Spain, 6-10 September 2021
This item is made available under a Creative Commons License
File(s)
Loading...
Name
chip_firing_split_graph.pdf
Size
261.08 KB
Format
Adobe PDF
Checksum (MD5)
6a370a05b62b19b3e5055a8e143cbbf4
Owning collection