The ballot-property conjecture for stable configurations on undirected binary trees
Statement
Let a stable configuration be a chip distribution on an undirected binary tree, and say that it satisfies the ballot property if, for each , the th smallest chip in the subtree rooted at the left child of a subtree's root has a smaller label than the th smallest chip in the subtree rooted at the right child. A subtree means any subtree of the tree.
Ballot-property conjecture. In a stable configuration, the whole tree and every subtree satisfy the ballot property.
The paper establishes the property for subtrees with two or three layers and reports computational verification for every stable configuration starting with chips. The general assertion remains unresolved in the supplied text.
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.