{"title":"Labeled Chip-Firing on Binary Trees with $$2^n-1$$ Chips","authors":"Gregg Musiker, Son Nguyen","doi":"10.1007/s00026-023-00680-0","DOIUrl":null,"url":null,"abstract":"<p>We study labeled chip-firing on binary trees starting with <span>\\(2^n-1\\)</span> 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.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00026-023-00680-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
