Ronnie Pavlov

Two seminar talks will be hosted, 9:30AM and 10:45AM, in each of the mornings of July 24, 25 and 26 in ESB 4133 Schedule Wednesday, July 24, 2024 Time: 9:30 AM Speaker: Brian Marcus, UBC and PIMS Title: Variations on Krieger's Embedding Theorem and a...

The 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...

In symbolic dynamics, a Z^d shift of finite type (or SFT) is the set of all ways to assign elements from a finite alphabet A to all sites of Z^d, subject to rules about which elements of A are allowed to appear next to each other. A simple example of...

In symbolic dynamics, a Z^d shift of finite type (or SFT) is the set of all ways to assign elements from a finite alphabet A to all sites of Z^d, subject to local rules about which elements of A are allowed to appear next to each other. A fundamental...