有$2^n-1$$芯片的二叉树上的标签芯片发射

IF 0.6 4区数学 Q4 MATHEMATICS, APPLIED

Annals of Combinatorics Pub Date : 2023-12-15 DOI:10.1007/s00026-023-00680-0

Gregg Musiker, Son Nguyen

引用次数: 0

摘要

我们研究了二叉树上的带标记芯片烧制过程，该过程的起点是最初放置在树根处的（2^n-1\）个芯片。我们证明了该过程终端配置的排序属性。我们还分析了终局移动的位置集，并证明这个位置集是一个模态网格。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

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

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Annals of Combinatorics 数学-应用数学

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches