Access the full text.
Sign up today, get DeepDyve free for 14 days.
Alexander Kirillov (2008)
An Introduction to Lie Groups and Lie Algebras
[A time-reversible cellular automaton can most easily be described by regarding its evolution law as a two-step process, for instance by first allowing the even sites to update, then the odd sites. The discrete Hamiltonian operator procedure of Chap. 19 may be used. Subsequently, we apply a perturbative algebra, starting from the Baker Campbell Hausdorff expansion.]
Published: Sep 3, 2016
Keywords: Cellular Automaton; Conjugacy Class; Evolution Operator; Time Reversibility; Direct Neighbour
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.