Cycle Equivalence of Finite Dynamical Systems Containing Symmetries

DOI10.1007/978-3-319-18812-6_6zbMath1435.37042OpenAlexW1164982053MaRDI QIDQ5501614

S. Mortveit, Matthew Macauley

Publication date: 4 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18812-6_6

zbMATH Keywords

acyclic orientationsgraph dynamical systemsautomata networkssequential dynamical systemstoric posetcycle equivalence

Mathematics Subject Classification ID

Topological and differentiable equivalence, conjugacy, moduli, classification of dynamical systems (37C15) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (1)

Attractor stability in finite asynchronous biological system models

Cites Work

• Unnamed Item
• Posets from admissible Coxeter sequences.
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• An introduction to sequential dynamical systems
• Conjugacy of Coxeter elements.
• On reorienting graphs by pushing down maximal vertices
• Elements of a theory of simulation. III: Equivalence of SDS.
• Toric partial orders
• Combinatorics of Coxeter Groups
• Order Independence in Asynchronous Cellular Automata
• On enumeration of conjugacy classes of Coxeter elements
• Cycle equivalence of graph dynamical systems
• A Contribution to the Theory of Chromatic Polynomials
• Conjugacy relation on Coxeter elements

This page was built for publication: Cycle Equivalence of Finite Dynamical Systems Containing Symmetries