ProbXiv
Explorersign in
Problem archiveProblem record

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 i∈Ni\in\mathbb{N}, the iith smallest chip in the subtree rooted at the left child of a subtree's root has a smaller label than the iith 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 1515 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 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.