Diagonal Periods and Newton Supports of Rules 30, 86 and 135

The single-seed Rule 30 cone has unbounded least diagonal periods in both directions. On the finite-support side, first contact fixes the least Newton index and an integer polynomial lift gives a Fibonacci ceiling. On the reflected Rule 86 side, a backward map on periodic tail profiles retains the zero boundary and bounds the largest period from below, independently of transient lengths. This argument extends the reset/integration criterion for period doubling. The physical Rule 135 orbit is a translated complement of Rule 30 after its first step, yielding finite or cofinite supports. A separately initialized auxiliary recurrence admits exact index-by-index stabilization. Residue tables and block formulas describe the remaining structure and permit evaluation from supplied representations. Their construction and minimum size remain distinct quantitative questions.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22736166
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Diagonal Periods and Newton Supports of Rules 30, 86 and 135

Tigran Nersissian
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Diagonal Periods and Newton Supports of Rules 30, 86 and 135

Tigran Nersissian
preprint en

Abstract

The single-seed Rule 30 cone has unbounded least diagonal periods in both directions. On the finite-support side, first contact fixes the least Newton index and an integer polynomial lift gives a Fibonacci ceiling. On the reflected Rule 86 side, a backward map on periodic tail profiles retains the zero boundary and bounds the largest period from below, independently of transient lengths. This argument extends the reset/integration criterion for period doubling. The physical Rule 135 orbit is a translated complement of Rule 30 after its first step, yielding finite or cofinite supports. A separately initialized auxiliary recurrence admits exact index-by-index stabilization. Residue tables and block formulas describe the remaining structure and permit evaluation from supplied representations. Their construction and minimum size remain distinct quantitative questions.

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.