Title: On Furstenberg systems of some aperiodic multiplicative functions

Speaker: Mariusz Lemańczyk – Nicolaus Copernicus University in Toruń

Abstract: Studying arithmetic properties of multiplicative functions through the so called Furstenberg systems became a powerful and fruitful ergodic tool when dealing with the Sarnak and Chowla conjectures, cf. Frantzikinakis-Host’s theorem on the validity of logarithmic Sarnak’s conjecture for systems having not too many ergodic measures.
The Chowla conjecture, originally formulated for the Liouville function, was expected to hold for a much larger class of multiplicative functions in the sense that it has precisely one Furstenberg system, and this system is “maximally random”.
In 2015‪ Matomäki‬ , Radziwiłł and Tao gave a counterexample to Elliot’s conjecture by constructing aperiodic multiplicative functions (bounded by 1) for which (already) the Chowla conjecture of order 2 fails.
During the talk I will try to describe recent results concerning a variety of Furstenberg systems for ‪Matomäki‬, Radziwiłł, Tao’s functions, in particular, showing that the Chowla conjecture holds for them along some subsequences. The talk is based on my joint work with Alex Gomilko and Thierry de la Rue.

Zoom link: https://osu.zoom.us/j/98033590349

Meeting ID: 980 3359 0349

Password: Mixing

Recorded Talk: https://osu.zoom.us/rec/play/PSnnADgz3z7coGFSBSjBqrbhouGsBc5pHy_Y4tNGRq09SGk1UlLhd-xFZkOPSvRQG0d6qqc7ZUqaJZn7.z4J5lZq-XrTXCnPN?continueMode=true&_x_zm_rtaid=jIq7z5RFQZ-o8LQDfPiUrA.1617500870127.d8f12381bc2a272d1c51682f2c0006f0&_x_zm_rhtaid=771

Title: Uniform Distribution of Saddle Connection Lengths

Speaker: Donald Robertson – University of Manchester

Abstract: Saddle connections on flat surfaces are those straight line trajectories connecting singular points. In this talk I will explain what that means and discuss work with Jon Chaika and Benjamin Dozier on the uniform distribution mod 1 of the lengths of saddle connections.

Zoom link: https://osu.zoom.us/j/98033590349

Meeting ID: 980 3359 0349

Password: Mixing

Recorded Talk: https://osu.zoom.us/rec/play/Gn_hXP0BBP7r3HPdodAJuEUxk3ed9ZUfUstA9aS6gKBrFBiLuyOmp6Y8tdA4zHta_Yk0zox-lIuk2iUR._SxZ3acW_MWm4WXD?continueMode=true&_x_zm_rtaid=8CfvQXwLTHOXESID46FWow.1616204141275.c79ea67121104fa26c652ee4a2cdd174&_x_zm_rhtaid=272

Title: Dbar-approachability, entropy density and B-free shifts

Speaker: Dominik Kwietniak – Jagiellonian University in Krakow

Abstract: Let dbar denote the pseudometric on the full shift over a
finite alphabet A given by the upper asymptotic density of the set of
positions at which two A-valued sequences differ. Write H-dbar for the
associated Hausdorff pseudometric for subsets of the full shift. We
study which properties of shift spaces (shifts) are closed with
respect to H-dbar. In particular, we study shifts, which are H-dbar
limits of their Markov approximations. We call these shifts
dbar-approachable. We provide a topological characterization of chain
mixing dbar-approachable shifts analogous to Friedman-Ornstein’s
characterization of Bernoulli processes.

We prove that many specification properties imply
dbar-approachability. It follows that mixing shifts of finite type,
mixing sofic shifts, and beta-shifts are dbar-approachable. We
construct minimal and proximal examples of mixing dbar-approachable
shifts. We also show that dbar-approachability and chain-mixing imply
dbar-stability, a property recently introduced by Tim Austin. This
leads to examples of minimal or proximal dbar-stable shift spaces,
answering a question posed by Austin. Finally, we show that the set of
shifts with entropy-dense ergodic measures is H-dbar closed. Note that
entropy-density of ergodic measures is known to follow from the
specification property, but the minimal or proximal examples are far
from having any specification. Finally, we show entropy-density for a
class of shifts that includes many interesting B-free shifts. These
shift spaces are not dbar-approachable, but they are H-dbar limits of
sequences of transitive sofic shifts, and this implies
entropy-density.

This is a joint work with Jakub Konieczny and Michal Kupsa.

Zoom link: https://osu.zoom.us/j/98033590349

Meeting ID: 980 3359 0349

Password: Mixing

Recorded talk: https://osu.zoom.us/rec/play/_DXkoWtXTB92Pui6F7zl4eoVstNWH1rMUdb2a8NjFe61zd2BC9dTZP4UnuUKAC9behs6MQs88XEToF8A.vhVYz7t7fI5_en7U?continueMode=true&_x_zm_rtaid=HImgc_KTTByZM_8W1gjyuA.1615523637945.3021b693a8b3eeed460d5a4c44061f1c&_x_zm_rhtaid=457