ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the labeled chip-firing process on a complete binary tree with 2n−12^n-1 nodes, using the labels 1,2,…,2n−11,2,\dots,2^n-1, 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 nn, the most likely terminal configuration is the unique binary search tree on the complete binary tree with 2n−12^n-1 nodes.

The conjecture is motivated by computations for n=3n=3 and n=4n=4, where the most likely terminal configuration was observed to be the binary search tree. The paper reports that reliable frequency data were unavailable for n≥5n\geq5 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.