pith. sign in

arxiv: 2411.03601 · v3 · submitted 2024-11-06 · 🌊 nlin.CG · cs.FL· math.DS

One-dimensional cellular automata with a unique active transition

Alonso Castillo-Ramirez , Maria G. Maga\~na-Chavez , Luguis de los Santos Ba\~nos This is my paper

Pith reviewed 2026-05-23 18:01 UTC · model grok-4.3

classification 🌊 nlin.CG cs.FLmath.DS
keywords cellular automataone-dimensional shiftsidempotencealmost equicontinuityactive transitionslocal rules
0
0 comments X

The pith

Cellular automata with exactly one active transition are either idempotent or strictly almost equicontinuous, depending on the transition pattern.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies one-dimensional cellular automata whose local rule copies the center cell in every neighborhood except one specific pattern p. It establishes that any such automaton is either idempotent, meaning two applications equal one, or strictly almost equicontinuous. The split is decided completely by the internal structure of p: idempotence holds exactly when p contains a subpattern that is invariant under a nonzero translation. A reader would care because the result shows how a single exceptional rule can force the entire system into one of two rigid dynamical classes without intermediate behaviors.

Core claim

Every cellular automaton τ with a unique active transition p ∈ A^S is either idempotent or strictly almost equicontinuous, and each case is characterized in terms of p; the idempotence of τ depends on the existence of a certain subpattern of p with a translational symmetry.

What carries the argument

The unique active transition p, which fixes the local function to equal the center cell everywhere except at p and thereby controls whether the global map is idempotent or strictly almost equicontinuous.

If this is right

  • If a subpattern of p admits a nonzero translational symmetry, then the automaton is idempotent.
  • If no such symmetric subpattern exists in p, then the automaton is strictly almost equicontinuous.
  • The global dynamical class is completely determined by local features of the single exceptional pattern p.
  • The classification holds for every alphabet size and every interval neighborhood containing zero.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar restrictions on the number of active transitions might classify larger families of cellular automata.
  • The translational-symmetry condition on p could be checked algorithmically to decide the class in finite time.
  • The result may extend to other notions of equicontinuity or to higher-dimensional grids under analogous uniqueness assumptions.

Load-bearing premise

The neighborhood is an interval containing zero and the local rule equals the center cell except exactly when the neighborhood matches one fixed pattern p.

What would settle it

An explicit cellular automaton with unique active transition p whose global map is neither idempotent nor strictly almost equicontinuous.

Figures

Figures reproduced from arXiv: 2411.03601 by Alonso Castillo-Ramirez, Luguis de los Santos Ba\~nos, Maria G. Maga\~na-Chavez.

Figure 1
Figure 1. Figure 1: Space-time diagram of CA with unique active transition [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Space-time diagram of CA with unique active transition [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
read the original abstract

A one-dimensional cellular automaton $\tau : A^\mathbb{Z} \to A^\mathbb{Z}$ is a transformation of the full shift defined via a finite neighborhood $S \subset \mathbb{Z}$ and a local function $\mu : A^S \to A$. We study the family of cellular automata whose finite neighborhood $S$ is an interval containing $0$, and there exists a pattern $p \in A^S$ satisfying that $\mu(z) = z(0)$ if and only if $z \neq p$; this means that these cellular automata have a unique \emph{active transition}. Despite its simplicity, this family presents interesting and subtle problems, as the behavior of the cellular automaton completely depends on the structure of $p$. We show that every cellular automaton $\tau$ with a unique active transition $p \in A^S$ is either idempotent or strictly almost equicontinuous, and we completely characterize each one of these situations in terms of $p$. In essence, the idempotence of $\tau$ depends on the existence of a certain subpattern of $p$ with a translational symmetry.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper claims that every one-dimensional cellular automaton τ with neighborhood S an interval containing 0 and a unique active transition p (i.e., local function μ(z) = z(0) exactly when z ≠ p) is either idempotent or strictly almost equicontinuous. It provides a complete characterization of both cases in terms of p, with the idempotent case depending on the existence of a subpattern of p possessing translational symmetry.

Significance. If the results hold, the work delivers an explicit dichotomy and characterization for this family of CA, directly linking the structure of the single active pattern p to global dynamical properties. The translational-symmetry condition on subpatterns is a concrete, checkable criterion that strengthens the result's utility for classification and verification in cellular automata dynamics.

minor comments (2)
  1. [Introduction] The definition and prior references for 'strictly almost equicontinuous' should be recalled or cited explicitly in the introduction or preliminaries section to improve accessibility for readers outside the immediate subfield.
  2. [Main theorem section] An illustrative example of a subpattern with translational symmetry (and one without) would clarify the idempotence characterization; consider adding this to the statement of the main theorem or immediately following it.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our results on one-dimensional cellular automata with a unique active transition and for recommending minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper derives a dichotomy (idempotent vs. strictly almost equicontinuous) and an explicit characterization of the idempotent case via a translational symmetry subpattern of p, starting from the standard definition of a CA with unique active transition (S interval containing 0, μ(z)=z(0) iff z≠p). This is a direct proof from the definitions of cellular automata, idempotence, and almost equicontinuity; no parameters are fitted, no self-citations are load-bearing for the central claim, and the symmetry condition is an independent combinatorial property of p rather than a renaming or self-definition. The derivation is self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard definitions of cellular automata, the full shift space, local functions, and dynamical properties such as idempotence and equicontinuity. No free parameters, ad-hoc axioms, or invented entities are introduced.

axioms (1)
  • standard math Standard properties of the full shift A^Z and local functions defining cellular automata.
    The paper builds directly on established definitions in symbolic dynamics and cellular automata theory.

pith-pipeline@v0.9.0 · 5746 in / 1043 out tokens · 36649 ms · 2026-05-23T18:01:12.772637+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

  1. [1]

    P., Mattos, T., Ruivo, E.: Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates

    Balbi, P. P., Mattos, T., Ruivo, E.: Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates. Comun. Nonlinear Sci. Numer. Simulat. 104 (2022) 106018. https://doi.org/10.1016/j.cnsns.2021.106018

    work page doi:10.1016/j.cnsns.2021.106018 2022

  2. [2]

    P., Mattos, T., Ruivo, E.: From Multiple to Single Updates Per Cell in El- ementary Cellular Automata with Neighbourhood Based Priority

    Balbi, P. P., Mattos, T., Ruivo, E.: From Multiple to Single Updates Per Cell in El- ementary Cellular Automata with Neighbourhood Based Priority. In: Das, S., Roy, S., Bhattacharjee, K. (eds) The Mathematical Artist. Emergence, Complexity and Computa- tion 45, Springer, Cham., 2022. https://doi.org/10.1007/978-3-031-03986-7_6

    work page doi:10.1007/978-3-031-03986-7_6 2022

  3. [3]

    Theoretical Computer Science 163.1-2 (1996) 291-302

    Blanchard, F., Maass, A.: Dynamical behaviour of Coven’s aperiodic cellular automata. Theoretical Computer Science 163.1-2 (1996) 291-302

    work page 1996

  4. [4]

    Castillo-Ramirez, A., Gadouleau, M.: Elementary, Finite and Linear vN-Regular Cellu- lar Automata, Inf. Comput. 274 (2020) 104533 https://doi.org/10.1016/j.ic.2020. 104533

    work page doi:10.1016/j.ic.2020 2020

  5. [5]

    G, Veliz-Quintero, E.: Idempotent cellular automata and their natural order, Theoret

    Castillo-Ramirez, A., Maga˜ na-Chavez, M. G, Veliz-Quintero, E.: Idempotent cellular automata and their natural order, Theoret. Comput. Sci. 1009 (2024) 114698. https: //doi.org/10.1016/j.tcs.2024.114698

    work page doi:10.1016/j.tcs.2024.114698 2024

  6. [6]

    Springer Monographs in Mathematics, Springer-Verlag Berlin Heidelberg, 2010

    Ceccherini-Silberstein, T., Coornaert, M.: Cellular Automata and Groups. Springer Monographs in Mathematics, Springer-Verlag Berlin Heidelberg, 2010

    work page 2010

  7. [7]

    https://doi.org/10.48550/arXiv.2409.09024

    Chandgotia, N., Marcus, B., Richey, J., Wu, C.: Shifts of Finite Type Obtained by Forbidding a Single Pattern (2024). https://doi.org/10.48550/arXiv.2409.09024

    work page doi:10.48550/arxiv.2409.09024 2024

  8. [8]

    al.: Recognizing Pattern and Rule of Mutation Signatures Corresponding to Cancer Types

    Chen, L., et. al.: Recognizing Pattern and Rule of Mutation Signatures Corresponding to Cancer Types. Front. Cell Dev. Biol., 25 August 2021. Sec. Molecular and Cellular Pathology 9 (2021). https://doi.org/10.3389/fcell.2021.712931

    work page doi:10.3389/fcell.2021.712931 2021

  9. [9]

    Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups. 2nd Ed. Mathematical Surveys and Monographs 7.I American Mathematical Society, Providence, 1964

    work page 1964

  10. [10]

    Concha-Vega, P., Goles, E., Montealegre, P., R´ ıos-Wilson, M., & Santiva˜ nez, J.: In- troducing the activity parameter for elementary cellular automata. Int. J. Mod. Phys. C 33(9) (2022) 2250121. https://doi.org/10.1142/S0129183122501212

    work page doi:10.1142/s0129183122501212 2022

  11. [11]

    M.: Topological entropy of block maps

    Coven, E. M.: Topological entropy of block maps. Proceedings of the American Math- ematical Society 78.4 (1980) 590-594

    work page 1980

  12. [12]

    Fates, N.: A tutorial on elementary cellular automata with fully asynchronous updating. Nat. Comput. 19 (1) (2020) 179–197. https://doi.org/10.1007/s11047-020-09782-7

    work page doi:10.1007/s11047-020-09782-7 2020

  13. [13]

    In: Meyers, R

    Fates, N.: Asynchronous Cellular Automata. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, Berlin, Heidelberg, 2018. https://doi.org/ 10.1007/978-3-642-27737-5_671-2 13

    work page doi:10.1007/978-3-642-27737-5_671-2 2018

  14. [14]

    Theoretical Computer Science 334 (2005) 3 – 33

    Kari, J.: Theory of cellular automata: a survey. Theoretical Computer Science 334 (2005) 3 – 33. https://doi.org/10.1016/j.tcs.2004.11.021

    work page doi:10.1016/j.tcs.2004.11.021 2005

  15. [15]

    Soci´ et´ e math´ ematique de France, 2003

    K˚ urka, P.: Topological and Symbolic Dynamics. Soci´ et´ e math´ ematique de France, 2003

    work page 2003

  16. [16]

    Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. 2nd Ed. Cambridge University Press, 2021. 14

    work page 2021