ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let reversible elementary second-order cellular automaton 115 (RESOCA 115) have finite configurations with periods. Two periods pp and p+3p+3 are called twins.

Twin-period recurrence conjecture. Assume that pp and p+3p+3 are twin periods. Then the next twin pair is p′p' and p′+3p'+3, where

p′=2p+9−3(−1)p2.p'=2p+\frac{9-3(-1)^p}{2}.

This conjecture proposes a recurrence for the experimentally observed twin periods of finite configurations of RESOCA 115; the source states that the authors do not know whether all periods are twins and presents the recurrence as a pattern suggested by experiments.

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.