The characterization of pairs occurring infinitely often among slowest walks

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.

Sources & referencesView supporting material

Primary source

Sam Spiro, “Slow Recurrences”, arXiv:1909.06517 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.