Symbolic dynamics is a branch of mathematics that deals with sequences of characters letters or "symbols" form the point of view of dynamical systems. The basic guiding philosophy is that sometimes it is possible to code and understand complicated systems by a sequence of discrete samples. The decimal expansion of real numbers is a simple example of this kind of procedure. Techniques and ideas from symbolic dynamics have found significant applications in data storage and transmission as well as other parts of mathematics. In this course we will introduce basic notions and results in symbolic dynamics, via interesting examples. We will illustrate relations to other fields and relate to the more general frameworks of topological dynamics and ergodic theory.
Basic topics to be covered:
A brief introduction to topological dynamics.
Shift spaces (subshifts).
Subshifts of finite type (SFT) and sofic shifts.
Cellular automata and sliding block codes, endomorphisms and automorphisms of shift spaces.
Topological conjugacy (isomorphism), embedding and factors of subshifts.
Topological entropy.
Possible additional topics, possibly as individual projects assigned to enrolled students:
Multidimensional shift spaces
Shift equivalence and strong shift equivalence of matrices.
Krieger’s embedding theorem.
Instructor : Tom Meyerovitch
Lecture Time and place: Thursday 14-16, Building 34 room 105
שאלות בנוגע לדרישות קדם, תוכן הקורס, חובות והרכב הציון בקורס? מתלבטים? מוזמנים לפנות אלי במייל או במשרד!
An introduction to symbolic dynamics and coding / Lind and Marcus
Symbolic Dynamics. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems
Symbolic Dynamics/ Kitchens
Dimension groups and Dynamical systems/ Durand and Perrin (preprint version public on Arxiv here)