Lecture

Ergodic properties of low complexity symbolic systems

Description

This lecture explores the ergodic properties of low complexity symbolic systems, focusing on the influence of complexity on dynamical properties. It delves into word complexity, Curtis-Hedlund-Lyndon Theorem, weak and strong mixing, the simplex of ergodic measures, the Liouville Shift, and the construction of minimal subshifts with uncountably many ergodic measures. The discussion extends to measurable Morse-Hedlund Theorem, Hamming metric, and the relationship between growth rates and ergodic measures. Various theorems and constructions are presented to illustrate the intricate dynamics and combinatorics involved.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.