The most likely terminal configuration conjecture for labeled chip-firing on binary trees
Statement
Consider the labeled chip-firing process on a complete binary tree with nodes, using the labels , and let a terminal configuration be a configuration obtained when no further firing moves are possible. A binary search tree is a binary tree in which every node's chip is larger than all chips in its left subtree and smaller than all chips in its right subtree; for these labels, there is a unique binary search tree.
Most likely terminal configuration conjecture. For all , the most likely terminal configuration is the unique binary search tree on the complete binary tree with nodes.
The conjecture is motivated by computations for and , where the most likely terminal configuration was observed to be the binary search tree. The paper reports that reliable frequency data were unavailable for because the number of possible terminal configurations grows rapidly.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.