ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bn∈(S)nb_n\in(\mathbb{S})^n be a cycle for the contact function σ:S⟶S\sigma:\mathbb{S}\longrightarrow\mathbb{S}. Call bnb_n an attractor if, for every t∈St\in\mathbb{S} and fixed k∈{0,…,n−1}k\in\{0,\ldots,n-1\}, the nn-tuple (σi(t),σi+1(t),…,σi+n−1(t))(\sigma^i(t),\sigma^{i+1}(t),\ldots,\sigma^{i+n-1}(t)) converges to a cyclic permutation of bnb_n as j→∞j\to\infty with i=nj+ki=nj+k. Attractor conjecture. The nine-cycle b9b_9 is an attractor. Numerical experiments suggest pointwise convergence of the iterates, while uniform convergence is not expected because σ\sigma is continuous; the supplied text gives no proof or resolution.

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.