Abstract
Two dynamical systems are cycle equivalent if they are topologically conjugate when restricted to their periodic points. In this paper, we extend our earlier results on cycle equivalence of asynchronous finite dynamical systems (FDSs) where the dependency graph may have a nontrivial automorphism group. We give conditions for when two update sequences \(\pi ,\pi '\) give cycle equivalent maps \(F_\pi , F_{\pi '}\), and we give improved upper bounds for the number of distinct cycle equivalence classes that can be generated by varying the update sequence. This paper contains a brief review of necessary background results and illustrating examples, and concludes with open questions and a conjecture.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a theory of simulation III: Equivalence of SDS. Appl. Math. Comput. 122, 325–340 (2001)
Björner, A., Brenti, F.: Combinatorics of Coxeter Groups. Springer-Verlag, New York (2005)
Chen, B.: Orientations, lattice polytopes, and group arrangements I, chromatic and tension polynomials of graphs. Ann. Comb. 13(4), 425–452 (2010)
Develin, M., Macauley, M., Reiner, V.: Toric partial orders. Trans. Amer. Math. Soc. (2014) (to appear)
Eriksson, H., Eriksson, K.: Conjugacy of coxeter elements. Electron. J. Combin. 16(2), R4 (2009)
Goles, E., Martínez., S.: Neural and Automata Networks: Dynamical Behavior and Applications. Mathematics and its Applications, vol. 58. Kluwer Academic, Dordrecht (1990)
Macauley, M., McCammond, J., Mortveit, H.S.: Order independence in asynchronous cellular automata. J. Cell. Autom. 3(1), 37–56 (2008)
Macauley, M., Mortveit, H.S.: On enumeration of conjugacy classes of Coxeter elements. Proc. Amer. Math. Soc. 136(12), 4157–4165 (2008)
Macauley, M., Mortveit, H.S.: Cycle equivalence of graph dynamical systems. Nonlinearity 22, 421–436 (2009)
Macauley, M., Mortveit, H.S.: Posets from admissible Coxeter sequences. Electron. J. Combin. 18(1), #R197 (2011)
Mortveit, H.S., Reidys, C.M.: An introduction to sequential dynamical systems. Universitext, Springer, New York (2007)
Pretzel, O.: On reorienting graphs by pushing down maximal vertices. Order 3(2), 135–153 (1986)
Shi, J.-Y.: Conjugacy relation on Coxeter elements. Adv. Math. 161, 1–19 (2001)
Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)
Acknowledgments
We thank our collaborators and members of the Network Dynamics and Simulation Science Laboratory (NDSSL) for discussions, suggestions and comments. This work has been partially supported by DTRA R&D Grant HDTRA1-09-1-0017, DTRA Grant HDTRA1-11-1-0016, DTRA CNIMS Contract HDTRA1-11-D-0016-0001, DOE Grant DE-SC0003957, and NSF grant DMS-1211691.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Macauley, M., Mortveit, H.S. (2015). Cycle Equivalence of Finite Dynamical Systems Containing Symmetries. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Lecture Notes in Computer Science(), vol 8996. Springer, Cham. https://doi.org/10.1007/978-3-319-18812-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-18812-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18811-9
Online ISBN: 978-3-319-18812-6
eBook Packages: Computer ScienceComputer Science (R0)