ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Nk,ℓN_{k,\ell} denote the number of labeled chips starting at the root of a kk-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 vv, let its children be ordered from left to right. Generalized ballot property. For every stable configuration resulting from Nk,ℓN_{k,\ell} labeled chips starting at the root, every vertex vv, every i∈{1,2,…,Nk,ℓ−1}i\in\{1,2,\dots,N_{k,\ell-1}\}, and every a,b∈{1,2,…,k}a,b\in\{1,2,\dots,k\} with a<ba<b, the iith smallest chip in the subtree rooted at the aath leftmost child of vv is less than the iith smallest chip in the subtree rooted at the bbth leftmost child of vv. 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 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.