Binary codes and period-2 orbits of sequential dynamical systems

zbMATH Open1406.37035arXiv1509.03907MaRDI QIDQ4560211FDOQ4560211

Authors: Colin Defant 

Publication date: 10 December 2018

Abstract: Let $[K_n,f,pi]$ be the (global) SDS map of a sequential dynamical system (SDS) defined over the complete graph $K_n$ using the update order $piin{S}_n$ in which all vertex functions are equal to the same function $fcolonmathbb{F}_2^{n}omathbb{F}_2^n$. Let $et{a}_n$ denote the maximum number of periodic orbits of period $2$ that an SDS map of the form $[K_n,f,pi]$ can have. We show that $et{a}_n$ is equal to the maximum number of codewords in a binary code of length $n-1$ with minimum distance at least $3$. This result is significant because it represents the first interpretation of this fascinating coding-theoretic sequence other than its original definition.

Full work available at URL: https://arxiv.org/abs/1509.03907

Recommendations

• Enumerating periodic orbits in sequential dynamical systems over graphs
• Counting periodic points in parallel graph dynamical systems
• Maximum number of periodic orbits in parallel dynamical systems
• On acyclic orientations and sequential dynamical systems
• Discrete, sequential dynamical systems

zbMATH Keywords

periodic orbitbinary codecomplete graphsequential dynamical system

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial dynamics (types of periodic orbits) (37E15)

Cited In (15)

• Counting periodic points in parallel graph dynamical systems
• Dynamical attraction in parallel network models
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems
• A five-element transformation monoid on labelled trees
• On the dynamics of semilattice networks
• Fuzzy parallel dynamical systems on Zadeh operators
• Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• Maximum number of periodic orbits in parallel dynamical systems
• Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
• Periods in XOR parallel dynamical systems over directed dependency graphs
• Enumerating periodic orbits in sequential dynamical systems over graphs
• Attractors and transient in sequential dynamical systems
• ON CODING OF SERIES OF HOMOCLINIC LOOPS
• Predecessors and Gardens of Eden in sequential dynamical systems over directed graphs

This page was built for publication: Binary codes and period-2 orbits of sequential dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560211)