One world numeration seminar Tuesday December 21, 2021, 2:30PM, Online Fan Lü (Sichuan Normal University) Multiplicative Diophantine approximation in the parameter space of beta-dynamical system Beta-transformation is a special kind of expanding dynamics, the total information of which can be determined by the orbits of some critical points (e.g., the point 1). Letting $T_{\beta}$ be the beta-transformation with $\beta>1$ and $x$ be a fixed point in $(0,1]$, we consider the set of parameters $(\alpha, \beta)$, such that the multiple $\|T^n_{\alpha}(x)\|\|T^n_{\beta}(x)\|$ is well approximated or badly approximated. The Gallagher-type question, Jarník-type question as well as the badly approximable pairs, i.e., Littlewood-type question are studied in detail. One world numeration seminar Tuesday December 7, 2021, 2:30PM, Online Jamie Walton (University of Nottingham) Extending the theory of symbolic substitutions to compact alphabets In this work, joint with Neil Mañibo and Dan Rust, we consider an extension of the theory of symbolic substitutions to infinite alphabets, by requiring the alphabet to carry a compact, Hausdorff topology for which the substitution is continuous. Such substitutions have been considered before, in particular by Durand, Ormes and Petite for zero-dimensional alphabets, and Queffélec in the constant length case. We find a simple condition which ensures that an associated substitution operator is quasi-compact, which we conjecture to always be satisfied for primitive substitutions on countable alphabets. In the primitive case this implies the existence of a unique natural tile length function and, for a recognisable substitution, that the associated shift space is uniquely ergodic. The main tools come from the theory of positive operators on Banach spaces. Very few prerequisites will be assumed, and the theory will be demonstrated via examples. One world numeration seminar Tuesday November 23, 2021, 2:30PM, Online Sascha Troscheit (Universität Wien) Analogues of Khintchine's theorem for random attractors Khintchine’s theorem is an important result in number theory which links the Lebesgue measure of certain limsup sets with the convergence/divergence of naturally occurring volume sums. This behaviour has been observed for deterministic fractal sets and inspired by this we investigate the random settings. Introducing randomisation into the problem makes some parts more tractable, while posing separate new challenges. In this talk, I will present joint work with Simon Baker where we provide sufficient conditions for a large class of stochastically self-similar and self-affine attractors to have positive Lebesgue measure. One world numeration seminar Tuesday November 16, 2021, 2:30PM, Online Lucía Rossi (Montanuniversität Leoben) Rational self-affine tiles associated to (nonstandard) digit systems In this talk we will introduce the notion of rational self-affine tiles, which are fractal-like sets that arise as the solution of a set equation associated to a digit system that consists of a base, given by an expanding rational matrix, and a digit set, given by vectors. They can be interpreted as the set of “fractional parts” of this digit system, and the challenge of this theory is that these sets do not live in a Euclidean space, but on more general spaces defined in terms of Laurent series. Steiner and Thuswaldner defined rational self-affine tiles for the case where the base is a rational matrix with irreducible characteristic polynomial. We present some tiling results that generalize the ones obtained by Lagarias and Wang: we consider arbitrary expanding rational matrices as bases, and simultaneously allow the digit sets to be nonstandard (meaning they are not a complete set of residues modulo the base). We also state some topological properties of rational self-affine tiles and give a criterion to guarantee positive measure in terms of the digit set. One world numeration seminar Tuesday November 9, 2021, 2:30PM, Online Zhiqiang Wang (East China Normal University) How inhomogeneous Cantor sets can pass a point Abstract: For $x > 0$, we define $\Upsilon(x) = \{ (a,b): x\in E_{a,b}, a>0, b>0, a+b \le 1 \}$, where the set $E_{a,b}$ is the unique nonempty compact invariant set generated by the inhomogeneous IFS $\{ f_0(x) = a x, f_1(x) = b(x+1) \}$. We show the set $\Upsilon(x)$ is a Lebesgue null set with full Hausdorff dimension in $\mathbb{R}^2$, and the intersection of sets $\Upsilon(x_1), \Upsilon(x_2), \cdots, \Upsilon(x_\ell)$ still has full Hausdorff dimension $\mathbb{R}^2$ for any finitely many positive real numbers $x_1, x_2, \cdots, x_\ell$. One world numeration seminar Tuesday November 9, 2021, 3PM, Online Younès Tierce (Université de Rouen Normandie) Extensions of the random beta-transformation Let $\beta \in (1,2)$ and $I_\beta := [0,\frac{1}{\beta-1}]$. Almost every real number of $I_\beta$ has infinitely many expansions in base $\beta$, and the random $\beta$-transformation generates all these expansions. We present the construction of a “geometrico-symbolic” extension of the random $\beta$-transformation, providing a new proof of the existence and unicity of an absolutely continuous invariant probability measure, and an expression of the density of this measure. This extension shows off some nice renewal times, and we use these to prove that the natural extension of the system is a Bernoulli automorphism. One world numeration seminar Tuesday November 2, 2021, 2:30PM, Online Pieter Allaart (University of North Texas) On the existence of Trott numbers relative to multiple bases Trott numbers are real numbers in the interval (0,1) whose continued fraction expansion equals their base-b expansion, in a certain liberal but natural sense. They exist in some bases, but not in all. In a previous OWNS talk, T. Jones sketched a proof of the existence of Trott numbers in base 10. In this talk I will discuss some further properties of these Trott numbers, and focus on the question: Can a number ever be Trott in more than one base at once? While the answer is almost certainly “no”, a full proof of this seems currently out of reach. But we obtain some interesting partial answers by using a deep theorem from Diophantine approximation. One world numeration seminar Tuesday October 26, 2021, 2:30PM, Online Michael Baake (Universität Bielefeld) Spectral aspects of aperiodic dynamical systems One way to analyse aperiodic systems employs spectral notions, either via dynamical systems theory or via harmonic analysis. In this talk, we will look at two particular aspects of this, after a quick overview of how the diffraction measure can be used for this purpose. First, we consider some concequences of inflation rules on the spectra via renormalisation, and how to use it to exclude absolutely continuous componenta. Second, we take a look at a class of dynamical systems of number-theoretic origin, how they fit into the spectral picture, and what (other) methods there are to distinguish them. One world numeration seminar Tuesday October 19, 2021, 2:30PM, Online Mélodie Lapointe (IRIF) q-analog of the Markoff injectivity conjecture The Markoff injectivity conjecture states that $w\mapsto\mu(w)_{12}$ is injective on the set of Christoffel words where $\mu:\{\mathtt{0},\mathtt{1}\}^*\to\mathrm{SL}_2(\mathbb{Z})$ is a certain homomorphism and $M_{12}$ is the entry above the diagonal of a $2\times2$ matrix $M$. Recently, Leclere and Morier-Genoud (2021) proposed a $q$-analog $\mu_q$ of $\mu$ such that $\mu_{q\to1}(w)_{12}=\mu(w)_{12}$ is the Markoff number associated to the Christoffel word $w$. We show that there exists an order $<_{radix}$ on $\{\mathtt{0},\mathtt{1}\}^*$ such that for every balanced sequence $s \in \{\mathtt{0},\mathtt{1}\}^\mathbb{Z}$ and for all factors $u, v$ in the language of $s$ with $u <_{radix} v$, the difference $\mu_q(v)_{12} - \mu_q(u)_{12}$ is a nonzero polynomial of indeterminate $q$ with nonnegative integer coefficients. Therefore, for every $q>0$, the map $\{\mathtt{0},\mathtt{1}\}^*\to\mathbb{R}$ defined by $w\mapsto\mu_q(w)_{12}$ is increasing thus injective over the language of a balanced sequence. The proof uses an equivalence between balanced sequences satisfying some Markoff property and indistinguishable asymptotic pairs. One world numeration seminar Tuesday October 12, 2021, 2:30PM, Online Liangang Ma (Binzhou University) Inflection points in the Lyapunov spectrum for IFS on intervals We plan to present the audience a general picture about regularity of the Lyapunov spectrum for some iterated function systems, with emphasis on its inflection points in case the spectrum is smooth. Some sharp or moderate relationship between the number of Lyapunov inflections and (essential) branch number of a linear system is clarified. As most numeration systems are non-linear ones, the corresponding relationship for these systems are still mysterious enough comparing with the linear systems. One world numeration seminar Tuesday October 5, 2021, 2:30PM, Online Lulu Fang (Nanjing University of Science and Technology) On upper and lower fast Khintchine spectra in continued fractions Let $\psi: \mathbb{N} \to \mathbb{R}^+$ be a function satisfying $\psi(n)/n \to \infty$ as $n \to \infty$. We investigate from a multifractal analysis point of view the growth speed of the sums $\sum_{k=1}^n \log a_k(x)$ with respect to $\psi(n)$, where $x = [a_1(x),a_2(x),\dots]$ denotes the continued fraction expansion of $x \in (0,1)$. The (upper, lower) fast Khintchine spectrum is defined as the Hausdorff dimension of the set of points $x \in (0,1)$ for which the (upper, lower) limit of $\frac{1}{\psi(n)} \sum_{k=1}^n \log a_k(x)$ is equal to 1. These three spectra have been studied by Fan, Liao, Wang & Wu (2013, 2016), Liao & Rams (2016). In this talk, we will give a new look at the fast Khintchine spectrum, and provide a full description of upper and lower fast Khintchine spectra. The latter improves a result of Liao and Rams (2016). One world numeration seminar Tuesday October 5, 2021, 3PM, Online Taylor Jones (University of North Texas) On the Existence of Numbers with Matching Continued Fraction and Decimal Expansion A Trott number in base 10 is one whose continued fraction expansion agrees with its base 10 expansion in the sense that [0;a_1,a_2,…] = 0.(a_1)(a_2)… where (a_i) represents the string of digits of a_i. As an example [0;3,29,54,7,…] = 0.329547… An analogous definition may be given for a Trott number in any integer base b>1, the set of which we denote by T_b. The first natural question is whether T_b is empty, and if not, for which b? We discuss the history of the problem, and give a heuristic process for constructing such numbers. We show that T_{10} is indeed non-empty, and uncountable. With more delicate techniques, a complete classification may be given to all b for which T_b is non-empty. We also discuss some further results, such as a (non-trivial) upper bound on the Hausdorff dimension of T_b, as well as the question of whether the intersection of T_b and T_c can be non-empty. One world numeration seminar Tuesday September 28, 2021, 2:30PM, Online Philipp Hieronymi (Universität Bonn) A strong version of Cobham's theorem Let k,l>1 be two multiplicatively independent integers. A subset X of N^n is k-recognizable if the set of k-ary representations of X is recognized by some finite automaton. Cobham’s famous theorem states that a subset of the natural numbers is both k-recognizable and l-recognizable if and only if it is Presburger-definable (or equivalently: semilinear). We show the following strengthening. Let X be k-recognizable, let Y be l-recognizable such that both X and Y are not Presburger-definable. Then the first-order logical theory of (N,+,X,Y) is undecidable. This is in contrast to a well-known theorem of Büchi that the first-order logical theory of (N,+,X) is decidable. Our work strengthens and depends on earlier work of Villemaire and Bès. The essence of Cobham's theorem is that recognizability depends strongly on the choice of the base k. Our results strengthens this: two non-Presburger definable sets that are recognizable in multiplicatively independent bases, are not only distinct, but together computationally intractable over Presburger arithmetic. This is joint work with Christian Schulz. One world numeration seminar Tuesday September 21, 2021, 2:30PM, Online Maria Siskaki (University of Illinois at Urbana-Champaign) The distribution of reduced quadratic irrationals arising from continued fraction expansions It is known that the reduced quadratic irrationals arising from regular continued fraction expansions are uniformly distributed when ordered by their length with respect to the Gauss measure. In this talk, I will describe a number theoretical approach developed by Kallies, Ozluk, Peter and Snyder, and then by Boca, that gives the error in the asymptotic behavior of this distribution. Moreover, I will present the respective result for the distribution of reduced quadratic irrationals that arise from even (joint work with F. Boca) and odd continued fractions. One world numeration seminar Tuesday September 14, 2021, 2:30PM, Online Steve Jackson (University of North Texas) Descriptive complexity in numeration systems Descriptive set theory gives a means of calibrating the complexity of sets, and we focus on some sets occurring in numerations systems. Also, the descriptive complexity of the difference of two sets gives a notion of the logical independence of the sets. A classic result of Ki and Linton says that the set of normal numbers for a given base is a Π_3^0 complete set. In work with Airey, Kwietniak, and Mance we extend to other numerations systems such as continued fractions, ????-expansions, and GLS expansions. In work with Mance and Vandehey we show that the numbers which are continued fraction normal but not base b normal is complete at the expected level of D_2(Π_3^0). An immediate corollary is that this set is uncountable, a result (due to Vandehey) only known previously assuming the generalized Riemann hypothesis. One world numeration seminar Tuesday September 7, 2021, 2:30PM, Online Oleg Karpenkov (University of Liverpool) On Hermite's problem, Jacobi-Perron type algorithms, and Dirichlet groups In this talk we introduce a new modification of the Jacobi-Perron algorithm in the three dimensional case. This algorithm is periodic for the case of totally-real conjugate cubic vectors. To the best of our knowledge this is the first Jacobi-Perron type algorithm for which the cubic periodicity is proven. This provides an answer in the totally-real case to the question of algebraic periodicity for cubic irrationalities posed in 1848 by Ch.Hermite. We will briefly discuss a new approach which is based on geometry of numbers. In addition we point out one important application of Jacobi-Perron type algorithms to the computation of independent elements in the maximal groups of commuting matrices of algebraic irrationalities. One world numeration seminar Tuesday July 6, 2021, 2:30PM, Online Niclas Technau (University of Wisconsin - Madison) Littlewood and Duffin-Schaeffer-type problems in diophantine approximation Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. Recently Sam Chow and I establish a fully-inhomogeneous version of Gallagher's theorem, and a diophantine fibre refinement. In this talk I outline the proof, and the tools involved in it. One world numeration seminar Tuesday June 29, 2021, 2:30PM, Online Polina Vytnova (University of Warwick) Hausdorff dimension of Gauss-Cantor sets and their applications to the study of classical Markov spectrum The classical Lagrange and Markov spectra are subsets of the real line which arise in connection with some problems in theory Diophantine approximation theory. In 1921 O. Perron gave a definition in terms of continued fractions, which allowed to study the Markov and Lagrange spectra using limit sets of iterated function schemes. In this talk we will see how the first transition point, where the Markov spectra acquires the full measure can be computed by the means of estimating Hausdorff dimension of the certain Gauss-Cantor sets. The talk is based on a joint work with C. Matheus, C. G. Moreira and M. Pollicott. One world numeration seminar Tuesday June 22, 2021, 2:30PM, Online Lingmin Liao (Université Paris-Est Créteil Val de Marne) Simultaneous Diophantine approximation of the orbits of the dynamical systems x2 and x3 We study the sets of points whose orbits of the dynamical systems x2 and x3 simultaneously approach to a given point, with a given speed. A zero-one law for the Lebesgue measure of such sets is established. The Hausdorff dimensions are also determined for some special speeds. One dimensional formula among them is established under the abc conjecture. At the same time, we also study the Diophantine approximation of the orbits of a diagonal matrix transformation of a torus, for which the properties of the (negative) beta transformations are involved. This is a joint work with Bing Li, Sanju Velani and Evgeniy Zorin. One world numeration seminar Tuesday June 15, 2021, 2:30PM, Online Sam Chow (University of Warwick) Dyadic approximation in the Cantor set We investigate the approximation rate of a typical element of the Cantor set by dyadic rationals. This is a manifestation of the times-two-times-three phenomenon, and is joint work with Demi Allen and Han Yu. One world numeration seminar Tuesday June 8, 2021, 2:30PM, Online Shigeki Akiyama (University of Tsukuba) Counting balanced words and related problems Balanced words and Sturmian words are ubiquitous and appear in the intersection of many areas of mathematics. In this talk, I try to explain an idea of S. Yasutomi to study finite balanced words. His method gives a nice way to enumerate number of balanced words of given length, slope and intercept. Applying this idea, we can obtain precise asymptotic formula for balanced words. The result is connected to some classical topics in number theory, such as Farey fraction, Riemann Hypothesis and Large sieve inequality. One world numeration seminar Tuesday June 1, 2021, 2:30PM, Online Bastián Espinoza (Université de Picardie Jules Verne and Universidad de Chile) Automorphisms and factors of finite topological rank systems Finite topological rank systems are a type of minimal S-adic subshift that includes many of the classical minimal systems of zero entropy (e.g. linearly recurrent subshifts, interval exchanges and some Toeplitz sequences). In this talk I am going to present results concerning the number of automorphisms and factors of systems of finite topological rank, as well as closure properties of this class with respect to factors and related combinatorial operations. One world numeration seminar Tuesday May 25, 2021, 2:30PM, Online Charles Fougeron (IRIF) Dynamics of simplicial systems and multidimensional continued fraction algorithms Motivated by the richness of the Gauss algorithm which allows to efficiently compute the best approximations of a real number by rationals, many mathematicians have suggested generalisations to study Diophantine approximations of vectors in higher dimensions. Examples include Poincaré's algorithm introduced at the end of the 19th century or those of Brun and Selmer in the middle of the 20th century. Since the beginning of the 90's to the present day, there has been many works studying the convergence and dynamics of these multidimensional continued fraction algorithms. In particular, Schweiger and Broise have shown that the approximation sequence built using Selmer and Brun algorithms converge to the right vector with an extra ergodic property. On the other hand, Nogueira demonstrated that the algorithm proposed by Poincaré almost never converges. Starting from the classical case of Farey's algorithm, which is an “additive” version of Gauss's algorithm, I will present a combinatorial point of view on these algorithms which allows to us to use a random walk approach. In this model, taking a random vector for the Lebesgue measure will correspond to following a random walk with memory in a labelled graph called symplicial system. The laws of probability for this random walk are elementary and we can thus develop probabilistic techniques to study their generic dynamical behaviour. This will lead us to describe a purely graph theoretic criterion to check the convergence of a continued fraction algorithm. One world numeration seminar Tuesday May 18, 2021, 2:30PM, Online Joseph Vandehey (University of Texas at Tyler) Solved and unsolved problems in normal numbers We will survey a variety of problems on normal numbers, some old, some new, some solved, and some unsolved, in the hope of spurring some new directions of study. Topics will include constructions of normal numbers, normality in two different systems simultaneously, normality seen through the lens of informational or logical complexity, and more. One world numeration seminar Tuesday May 11, 2021, 2:30PM, Online Giulio Tiozzo (University of Toronto) The bifurcation locus for numbers of bounded type We define a family B(t) of compact subsets of the unit interval which provides a filtration of the set of numbers whose continued fraction expansion has bounded digits. This generalizes to a continuous family the well-known sets of numbers whose continued fraction expansion is bounded above by a fixed integer. We study how the set B(t) changes as the parameter t ranges in [0,1], and describe precisely the bifurcations that occur as the parameters change. Further, we discuss continuity properties of the Hausdorff dimension of B(t) and its regularity. Finally, we establish a precise correspondence between these bifurcations and the bifurcations for the classical family of real quadratic polynomials. Joint with C. Carminati. One world numeration seminar Tuesday May 4, 2021, 4PM, Online Tushar Das (University of Wisconsin - La Crosse) Hausdorff Hensley Good & Gauss Several participants of the One World Numeration Seminar (OWNS) will know Hensley's haunting bounds (c. 1990) for the dimension of irrationals whose regular continued fraction expansion partial quotients are all at most N; while some might remember Good's great bounds (c. 1940) for the dimension of irrationals whose partial quotients are all at least N. We will report on relatively recent results in https://arxiv.org/abs/2007.10554 that allow one to extend such fabulous formulae to unexpected expansions. Our technology may be utilized to study various systems arising from numeration, dynamics, or geometry. The talk will be accessible to students and beyond, and I hope to present a sampling of open questions and research directions that await exploration. One world numeration seminar Tuesday April 27, 2021, 2:30PM, Online Boris Adamczewski (CNRS, Université Claude Bernard Lyon 1) Expansions of numbers in multiplicatively independent bases: Furstenberg's conjecture and finite automata It is commonly expected that expansions of numbers in multiplicatively independent bases, such as 2 and 10, should have no common structure. However, it seems extraordinarily difficult to confirm this naive heuristic principle in some way or another. In the late 1960s, Furstenberg suggested a series of conjectures, which became famous and aim to capture this heuristic. The work I will discuss in this talk is motivated by one of these conjectures. Despite recent remarkable progress by Shmerkin and Wu, it remains totally out of reach of the current methods. While Furstenberg’s conjectures take place in a dynamical setting, I will use instead the language of automata theory to formulate some related problems that formalize and express in a different way the same general heuristic. I will explain how the latter can be solved thanks to some recent advances in Mahler’s method; a method in transcendental number theory initiated by Mahler at the end of the 1920s. This a joint work with Colin Faverjon. One world numeration seminar Tuesday April 20, 2021, 2:30PM, Online Ayreena Bakhtawar (La Trobe University) Metrical theory for the set of points associated with the generalized Jarnik-Besicovitch set From Lagrange's (1770) and Legendre's (1808) results we conclude that to find good rational approximations to an irrational number we only need to focus on its convergents. Let [a_1(x),a_2(x),…] be the continued fraction expansion of a real number x ∈ [0,1). The Jarnik-Besicovitch set in terms of continued fraction consists of all those x ∈ [0,1) which satisfy a_{n+1}(x) ≥ e^{τ (log|T'x|+⋯+log|T'(T^{n-1}x)|)} for infinitely many n ∈ N, where a_{n+1}(x) is the (n+1)-th partial quotient of x and T is the Gauss map. In this talk, I will focus on determining the Hausdorff dimension of the set of real numbers x ∈ [0,1) such that for any m ∈ N the following holds for infinitely many n ∈ N: a_{n+1}(x)a_{n+2}(x)⋯a_{n+m}(x) ≥ e^{τ(x)(f(x)+⋯+f(T^{n-1}x))}, where f and τ are positive continuous functions. Also we will see that for appropriate choices of m, τ(x) and f(x) our result implies various classical results including the famous Jarnik-Besicovitch theorem. One world numeration seminar Tuesday April 13, 2021, 2:30PM, Online Andrew Mitchell (University of Birmingham) Measure theoretic entropy of random substitutions One world numeration seminar Tuesday March 30, 2021, 2:30PM, Online Michael Drmota (TU Wien) (Logarithmic) Densities for Automatic Sequences along Primes and Squares It is well known that the every letter α of an automatic sequence a(n) has a logarithmic density – and it can be decided when this logarithmic density is actually a density. For example, the letters 0 and 1 of the Thue-Morse sequences t(n) have both frequences 1/2. [The Thue-Morse sequence is the binary sum-of-digits functions modulo 2.] The purpose of this talk is to present a corresponding result for subsequences of general automatic sequences along primes and squares. This is a far reaching generalization of two breakthrough results of Mauduit and Rivat from 2009 and 2010, where they solved two conjectures by Gelfond on the densities of 0 and 1 of t(p_n) and t(n^2) (where p_n denotes the sequence of primes). More technically, one has to develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. Then as an application one can deduce that the logarithmic densities of any automatic sequence along squares (n^2)_{n≥0} and primes (p_n)_{n≥1} exist and are computable. Furthermore, if densities exist then they are (usually) rational. This is a joint work with Boris Adamczewski and Clemens Müllner. One world numeration seminar Tuesday March 23, 2021, 2:30PM, Online Godofredo Iommi (Pontificia Universidad Católica de Chile) Arithmetic averages and normality in continued fractions Every real number can be written as a continued fraction. There exists a dynamical system, the Gauss map, that acts as the shift in the expansion. In this talk, I will comment on the Hausdorff dimension of two types of sets: one of them defined in terms of arithmetic averages of the digits in the expansion and the other related to (continued fraction) normal numbers. In both cases, the non compactness that steams from the fact that we use countable many partial quotients in the continued fraction plays a fundamental role. Some of the results are joint work with Thomas Jordan and others together with Aníbal Velozo. One world numeration seminar Tuesday March 16, 2021, 2:30PM, Online Alexandra Skripchenko (Higher School of Economics) Double rotations and their ergodic properties Double rotations are the simplest subclass of interval translation mappings. A double rotation is of finite type if its attractor is an interval and of infinite type if it is a Cantor set. It is easy to see that the restriction of a double rotation of finite type to its attractor is simply a rotation. It is known due to Suzuki - Ito - Aihara and Bruin - Clark that double rotations of infinite type are defined by a subset of zero measure in the parameter set. We introduce a new renormalization procedure on double rotations, which is reminiscent of the classical Rauzy induction. Using this renormalization we prove that the set of parameters which induce infinite type double rotations has Hausdorff dimension strictly smaller than 3. Moreover, we construct a natural invariant measure supported on these parameters and show that, with respect to this measure, almost all double rotations are uniquely ergodic. In my talk I plan to outline this proof that is based on the recent result by Ch. Fougeron for simplicial systems. I also hope to discuss briefly some challenging open questions and further research plans related to double rotations. The talk is based on a joint work with Mauro Artigiani, Charles Fougeron and Pascal Hubert. One world numeration seminar Tuesday March 9, 2021, 2:30PM, Online Natalie Priebe Frank (Vassar College) The flow view and infinite interval exchange transformation of a recognizable substitution A flow view is the graph of a measurable conjugacy between a substitution or S-adic subshift or tiling space and an exchange of infinitely many intervals in [0,1]. The natural refining sequence of partitions of the sequence space is transferred to [0,1] with Lebesgue measure using a canonical addressing scheme, a fixed dual substitution, and a shift-invariant probability measure. On the flow view, sequences are shown horizontally at a height given by their image under conjugacy. In this talk I'll explain how it all works and state some results and questions. There will be pictures. One world numeration seminar Tuesday March 2, 2021, 4PM, Online Vitaly Bergelson (Ohio State University) Normal sets in (ℕ,+) and (ℕ,×) We will start with discussing the general idea of a normal set in a countable cancellative amenable semigroup, which was introduced and developed in the recent paper “A fresh look at the notion of normality” (joint work with Tomas Downarowicz and Michał Misiurewicz). We will move then to discussing and juxtaposing combinatorial and Diophantine properties of normal sets in semigroups (ℕ,+) and (ℕ,×). We will conclude the lecture with a brief review of some interesting open problems. One world numeration seminar Tuesday February 23, 2021, 2:30PM, Online Seulbee Lee (Scuola Normale Superiore di Pisa) Odd-odd continued fraction algorithm The classical continued fraction gives the best approximating rational numbers of an irrational number. We define a new continued fraction, say odd-odd continued fraction, which gives the best approximating rational numbers whose numerators and denominators are odd. We see that a jump transformation associated to the Romik map induces the odd-odd continued fraction. We discuss properties of the odd-odd continued fraction expansions. This is joint work with Dong Han Kim and Lingmin Liao. One world numeration seminar Tuesday February 16, 2021, 2:30PM, Online Gerardo González Robert (Universidad Nacional Autónoma de México) Good's Theorem for Hurwitz Continued Fractions In 1887, Adolf Hurwitz introduced a simple procedure to write any complex number as a continued fraction with Gaussian integers as partial denominators and with partial numerators equal to 1. While similarities between regular and Hurwitz continued fractions abound, there are important differences too (for example, as shown in 1974 by R. Lakein, Serret's theorem on equivalent numbers does not hold in the complex case). In this talk, after giving a short overview of the theory of Hurwitz continued fractions, we will state and sketch the proof of a complex version of I. J. Good's theorem on the Hausdorff dimension of the set of real numbers whose regular continued fraction tends to infinity. Finally, we will discuss some open problems. One world numeration seminar Tuesday February 9, 2021, 2:30PM, Online Clemens Müllner (TU Wien) Multiplicative automatic sequences It was shown by Mariusz Lemańczyk and the author that automatic sequences are orthogonal to bounded and aperiodic multiplicative functions. This is a manifestation of the disjointedness of additive and multiplicative structures. We continue this path by presenting in this talk a complete classification of complex-valued sequences which are both multiplicative and automatic. This shows that the intersection of these two worlds has a very special (and simple) form. This is joint work with Mariusz Lemańczyk and Jakub Konieczny. One world numeration seminar Tuesday February 2, 2021, 2:30PM, Online Samuel Petite (Université de Picardie Jules Verne) Interplay between finite topological rank minimal Cantor systems, S-adic subshifts and their complexity The family of minimal Cantor systems of finite topological rank includes Sturmian subshifts, coding of interval exchange transformations, odometers and substitutive subshifts. They are known to have dynamical rigidity properties. In a joint work with F. Durand, S. Donoso and A. Maass, we provide a combinatorial characterization of such subshifts in terms of S-adic systems. This enables to obtain some links with the factor complexity function and some new rigidity properties depending on the rank of the system. One world numeration seminar Tuesday January 26, 2021, 2:30PM, Online Carlo Carminati (Università di Pisa) Prevalence of matching for families of continued fraction algorithms: old and new results We will give an overview of the phenomenon of matching, which was first observed in the family of Nakada's α-continued fractions, but is also encountered in other families of continued fraction algorithms. Our main focus will be the matching property for the family of Ito-Tanaka continued fractions: we will discuss the analogies with Nakada's case (such as prevalence of matching), but also some unexpected features which are peculiar of this case. The core of the talk is about some recent results obtained in collaboration with Niels Langeveld and Wolfgang Steiner. One world numeration seminar Tuesday January 19, 2021, 2:30PM, Online Tom Kempton (University of Manchester) Bernoulli Convolutions and Measures on the Spectra of Algebraic Integers Given an algebraic integer beta and alphabet A = {-1,0,1}, the spectrum of beta is the set \Sigma(\beta) := \{ \sum_{i=1}^n a_i \beta^i : n \in \mathbb{N}, a_i \in A \}. In the case that beta is Pisot one can study the spectrum of beta dynamically using substitutions or cut and project schemes, and this allows one to see lots of local structure in the spectrum. There are higher dimensional analogues for other algebraic integers. In this talk we will define a random walk on the spectrum of beta and show how, with appropriate renormalisation, this leads to an infinite stationary measure on the spectrum. This measure has local structure analagous to that of the spectrum itself. Furthermore, this measure has deep links with the Bernoulli convolution, and in particular new criteria for the absolute continuity of Bernoulli convolutions can be stated in terms of the ergodic properties of these measures. One world numeration seminar Tuesday January 5, 2021, 2:30PM, Online Claire Merriman (Ohio State University) alpha-odd continued fractions The standard continued fraction algorithm come from the Euclidean algorithm. We can also describe this algorithm using a dynamical system of [0,1), where the transformation that takes x to the fractional part of 1/x is said to generate the continued fraction expansion of x. From there, we ask two questions: What happens to the continued fraction expansion when we change the domain to something other than [0,1)? What happens to the dynamical system when we impose restrictions on the continued fraction expansion, such as finding the nearest odd integer instead of the floor? This talk will focus on the case where we first restrict to odd integers, then start shifting the domain [α-2, α). This talk is based on joint work with Florin Boca and animations done by Xavier Ding, Gustav Jennetten, and Joel Rozhon as part of an Illinois Geometry Lab project.