The generalized ballot property for labeled chips on k-ary trees
Statement
Let denote the number of labeled chips starting at the root of a -ary tree in the setting of the paper, and let a stable configuration be one obtained from these chips by chip-firing. For a vertex , let its children be ordered from left to right. Generalized ballot property. For every stable configuration resulting from labeled chips starting at the root, every vertex , every , and every with , the th smallest chip in the subtree rooted at the th leftmost child of is less than the th smallest chip in the subtree rooted at the th leftmost child of . This generalizes the binary ballot property from comparisons between two sides of a vertex to comparisons among all ordered child subtrees; its validity is presented as an open question.
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.