ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (n0,n1,…)(n_0,n_1,\ldots) be a Collatz orbit with n0>1n_0>1. Let τ1<τ2<⋯\tau_1<\tau_2<\cdots be successive fiber-5757 return times, set qj=⌊nτj/64⌋q_j=\lfloor n_{\tau_j}/64\rfloor, and let IrI_r be the invariant core modulo 8r8^r. Define the raw inter-chain return fraction

R^r(n0)=lim sup⁡N→∞#{1≤j≤N:qj mod 8r∈Ir, j inter-chain}#{1≤j≤N:j inter-chain},\widehat R_r(n_0)=\limsup_{N\to\infty}\frac{\#\{1\le j\le N:q_j\bmod8^r\in I_r,\ j\text{ inter-chain}\}}{\#\{1\le j\le N:j\text{ inter-chain}\}},

and the normalised ratio

Rr(n0)=R^r(n0)∣Ir∣/8r.R_r(n_0)=\frac{\widehat R_r(n_0)}{|I_r|/8^r}.

Thus Rr=1R_r=1 is the baseline density and Rr<1R_r<1 means under-visitation of IrI_r. Define the per-return memory supply by c′(n0)=−log⁡2Rr(n0)c'(n_0)=-\log_2R_r(n_0). Information-rate bound. For every n0>1n_0>1 and every r≥2r\ge2 at which absorption holds,

c′(n0)<c0=log⁡2 ⁣(1024129)≈2.989.c'(n_0)<c_0=\log_2\!\left(\frac{1024}{129}\right)\approx2.989.

The main reduction theorem states that this orbitwise bound would imply the Collatz conjecture. The statement is explicitly the sole unresolved dynamical input in the paper, and the numerical constant is based only on the known-gap partial kernel; including unresolved larger gaps would make the bound harder to satisfy.

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.