Labeled Chip-Firing on Binary Trees with 2 n- 1 Chips

Gregg Musiker; Son Nguyen

doi:10.1007/s00026-023-00680-0

Labeled Chip-Firing on Binary Trees with 2 ⁿ- 1 Chips

Gregg Musiker, Son Nguyen

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We study labeled chip-firing on binary trees starting with 2 ⁿ- 1 chips initially placed at the root. We prove a sorting property of terminal configurations of the process. We also analyze the end game moves poset and prove that this poset is a modular lattice.

Original language	English (US)
Journal	Annals of Combinatorics
DOIs	https://doi.org/10.1007/s00026-023-00680-0
State	Accepted/In press - 2023

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

Keywords

Binary tree
Confluence
Labeled chip-firing
Lattice poset

Access

10.1007/s00026-023-00680-0

Cite this

@article{07ed65e9012949ecbe6145dfe96906b0,

title = "Labeled Chip-Firing on Binary Trees with 2 n- 1 Chips",

abstract = "We study labeled chip-firing on binary trees starting with 2 n- 1 chips initially placed at the root. We prove a sorting property of terminal configurations of the process. We also analyze the end game moves poset and prove that this poset is a modular lattice.",

keywords = "Binary tree, Confluence, Labeled chip-firing, Lattice poset",

author = "Gregg Musiker and Son Nguyen",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.",

year = "2023",

doi = "10.1007/s00026-023-00680-0",

language = "English (US)",

journal = "Annals of Combinatorics",

issn = "0218-0006",

publisher = "Birkhauser Verlag Basel",

}

TY - JOUR

T1 - Labeled Chip-Firing on Binary Trees with 2 n- 1 Chips

AU - Musiker, Gregg

AU - Nguyen, Son

PY - 2023

Y1 - 2023

N2 - We study labeled chip-firing on binary trees starting with 2 n- 1 chips initially placed at the root. We prove a sorting property of terminal configurations of the process. We also analyze the end game moves poset and prove that this poset is a modular lattice.

AB - We study labeled chip-firing on binary trees starting with 2 n- 1 chips initially placed at the root. We prove a sorting property of terminal configurations of the process. We also analyze the end game moves poset and prove that this poset is a modular lattice.

KW - Binary tree

KW - Confluence

KW - Labeled chip-firing

KW - Lattice poset

UR - http://www.scopus.com/inward/record.url?scp=85179739066&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85179739066&partnerID=8YFLogxK

U2 - 10.1007/s00026-023-00680-0

DO - 10.1007/s00026-023-00680-0

M3 - Article

AN - SCOPUS:85179739066

SN - 0218-0006

JO - Annals of Combinatorics

JF - Annals of Combinatorics

ER -