ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime-power alphabet size q≥2q\geq2, an integer kernel dimension m≥2m\geq2, and a parameter β∈(0,1)\beta\in(0,1), define

g0(x)=(x(1−x))β.g_{0}(x)=(x(1-x))^{\beta}.

Concavity conjecture. The function g‾n(x)\overline{g}_{n}(x) is concave on [0,1][0,1] for every nn.

If true, this would make the scaling analysis of the associated sequence of inhomogeneous polar codes rigorous in terms of λm\lambda_m. The source presents this as unproved; the notation g‾n\overline{g}_n is not defined in the supplied span.

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.