Title	Tree shift entropy
Creator	Petersen, Karl
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-05-16T15:00
Description	In joint work with Ibrahim Salama, we study the complexity function $p_\tau(n)$ of a labeled tree or tree shift, which counts as a function of $n$ the number of different labelings of a shape of size $n$. We give a definition of entropy, prove that the limit in the definition exists, and that the limit is the infimum. For tree shifts determined by adjacency constraints a version of Pavlov's strip technique proves strict inequality with dimension and provides an efficient approximation method. Attractive questions concern equilibrium measures and relations with other kinds of entropy.
Extent	57.0 minutes
Subject	Mathematics; Dynamical systems and ergodic theory; Group theory and generalizations; Dynamical systems
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of North Carolina
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-11-13
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0385178
URI	http://hdl.handle.net/2429/72266
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos