ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a set of relatively prime pairs. For (α,β)∈T(\alpha,\beta)\in T, let sα,β(n)s^{\alpha,\beta}(n) denote the corresponding slow-walk function, define

sT(n)=max⁡(α,β)∈Tsα,β(n),ST(n)={(α,β):sα,β(n)=sT(n)},\mathbf{s}_T(n)=\max_{(\alpha,\beta)\in T}s^{\alpha,\beta}(n),\qquad \mathbf{S}_T(n)=\{(\alpha,\beta):s^{\alpha,\beta}(n)=\mathbf{s}_T(n)\},

and let

Γ=ΓT=min⁡{γα,β:(α,β)∈T},RT′={(α,β)∈T:γα,β<Γ2}.\Gamma=\Gamma_T=\min\{\gamma_{\alpha,\beta}:(\alpha,\beta)\in T\},\qquad R_T'=\{(\alpha,\beta)\in T:\gamma_{\alpha,\beta}<\Gamma^2\}.

Characterization conjecture. There exist infinitely many nn with (α,β)∈ST(n)(\alpha,\beta)\in\mathbf{S}_T(n) if and only if (α,β)∈RT′(\alpha,\beta)\in R_T'. This concerns which relatively prime parameter pairs occur infinitely often as maximizers of the slow-walk function; the paper notes that the only-if direction may require handling the boundary case γα,β=Γ2\gamma_{\alpha,\beta}=\Gamma^2, while the if direction is left 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.