ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let {L,R}⋆\{L,R\}^{\star} be the set of finite words over {L,R}\{L,R\}, and let PvP_v denote the probability measure on Z\mathbb{Z} attached to the tree node indexed by vv. For a word vv, write Pv(N)P_v(\mathbb{N}) and Pv(−N)P_v(-\mathbb{N}) for the masses on the nonnegative and nonpositive integers, respectively.

Tree-asymmetry conjecture. For every v∈{L,R}⋆v\in\{L,R\}^{\star},

PLv(N)>12andPRv(−N)>12.P_{Lv}(\mathbb{N})>\frac{1}{2}\quad\text{and}\quad P_{Rv}(-\mathbb{N})>\frac{1}{2}.

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 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.