Subshifts with very low word complexity
Speaker: Ronnie Pavlov
Date: Fri, Jul 26, 2024
Location: PIMS, University of British Columbia
Conference: Mini Conference on Symbolic Dynamics at UBC
Subject: Mathematics
Class: Scientific
Date: Fri, Jul 26, 2024
Location: PIMS, University of British Columbia
Conference: Mini Conference on Symbolic Dynamics at UBC
Subject: Mathematics
Class: Scientific
Abstract:
he word complexity function p(n) of a subshift X measures the number of n-letter words appearing in sequences in X, and X is said to have linear complexity if p(n)/n is bounded. It’s been known since work of Ferenczi that linear word complexity highly constrains the dynamical behaviour of a subshift.
