ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK be the set used in the source, let d(x,K)d(x,K) denote the distance from xx to KK, and set A(x)=−d(x,K)A(x)=-d(x,K). Let T(x)=2x(mod1)T(x)=2x\pmod 1 on [0,1][0,1], with inverse branch τ1(x)=x/2\tau_1(x)=x/2. Define

G(x)=∑i=1+∞A(τ1i(x)).G(x)=\sum_{i=1}^{+\infty}A\left(\tau_1^i(x)\right).

A subaction is a function satisfying the corresponding ergodic-optimization inequality. The explicit subaction conjecture. The function

V(x)=G(x)I[0,1/2)(x)+G(1−x)I[1/2,1](x)V(x)=G(x)I_{[0,1/2)}(x)+G(1-x)I_{[1/2,1]}(x)

is a subaction. The formula gives an explicit candidate subaction for the distance-to-KK potential under the doubling map. The source reports numerical evidence for calibrated-subaction behavior but does not establish the conjecture.

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.