Median-preserving conjecture for the stopped-random-walk tree dynamics
Statement
Let be the set of finite words over , and let denote the probability measure on attached to the tree node indexed by . For a word , write and for the masses on the nonnegative and nonpositive integers, respectively.
Tree-asymmetry conjecture. For every ,
This asserts that the strict asymmetry created by the first left or right step persists throughout the entire tree evolution. It is presented as a generalization of Cusick's conjecture; the weaker median inequalities are discussed separately, and the proposed strict statement remains open.
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.