Dynamical Systems and Analysis Seminar - Petra Staynova
| Dates: | 4 March 2024 |
|---|
| Times: | 14:00 - 15:00 |
|---|
| What is it: | Seminar |
|---|
| Organiser: | Department of Mathematics |
|---|
| Who is it for: | University staff, External researchers, Current University students |
|---|
|
Speaker: Petra Staynova (University of Derby)
Title: A cornucopia of bounds
Abstract: In this talk we consider right-infinite words over a finite alphabet, which are generated via substitution rules. A well-known way of studying complexity of these words is via the question 'how many finite subwords of a given length does this infinite word have?', which gives rise to the notion of subword complexity. If instead one considers what types of (finite) subwords occur as arithmetic subsequences, one can obtain a different and very interesting measure of complexity. In this talk, we consider the occurrence of monochromatic (i.e. same letter) arithmetic progressions within right-infinite words, and provide asymptotic growth rates in some (general) cases. No previous knowledge is assumed, and the talk will start from the basics of substitution systems.
Room: Frank Adams 1
Further information: https://personalpages.manchester.ac.uk/staff/yotam.smilansky/dynamics_analysis
Travel and Contact Information
Find event
Frank Adams 1
Alan Turing Building
Manchester
