Reem Yassawi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Reem Yassawi has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Johannes Kellendonk
Université Claude Bernard Lyon 1
5 shared publications - Valérie Berthé
Université Paris Cité, CNRS, IRIF, Paris, France
3 shared publications - Neil Mañibo
Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany
2 shared publications - Paulina Cecchi Bernales
Departamento de Matemáticas, Facultad de Ciencias, Universidad de Chile, Santiago, Chile
2 shared publications - Alvaro Bustos
Facultad de Matemáticas Pontificia Universidad Católica de Chile 7820436 Macul, Santiago, Chile
1 shared publication - Alvaro Bustos-Gajardo
School of Mathematics and Statistics, The Open University, Milton Keynes, UK
1 shared publication
Latest Publications
- 13 May 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 36 (07) , 1-39
Mahler equations for Zeckendorf numeration
A Pisot numeration system for is one where the sequence of positive integers , with , is generated by a recurrence whose polynomial is the minimal polynomial of a Pisot number. The Zeckendorf numeration is the simplest such example. We define generalised equations of -Mahler type, and we show that if a sequence over a commutative ring is -regular, then it is the sequence of coefficients of a series which is a solution of a -Mahler equation. Conversely, if the -Mahler equation is isolating, then its solutions define -regular sequences. This is a generalisation of results of Becker and Dumas. We provide an example to show that there exist non-isolating -Mahler equations whose solutions do not define -regular sequences. Our proof yields a new construction of weighted automata that generate classical -regular sequences. Our results can be generalised to numeration systems generated by recurrences whose characteristic polynomial is the minimal polynomial of a Pisot number.- 13 May 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 36 (07) , 1-39
Mahler equations for Zeckendorf numeration
A Pisot numeration system for is one where the sequence of positive integers , with , is generated by a recurrence whose polynomial is the minimal polynomial of a Pisot number. The Zeckendorf numeration is the simplest such example. We define generalised equations of -Mahler type, and we show that if a sequence over a commutative ring is -regular, then it is the sequence of coefficients of a series which is a solution of a -Mahler equation. Conversely, if the -Mahler equation is isolating, then its solutions define -regular sequences. This is a generalisation of results of Becker and Dumas. We provide an example to show that there exist non-isolating -Mahler equations whose solutions do not define -regular sequences. Our proof yields a new construction of weighted automata that generate classical -regular sequences. Our results can be generalised to numeration systems generated by recurrences whose characteristic polynomial is the minimal polynomial of a Pisot number.- Open Access
- 16 January 2025
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 206 (3) , 507-549
Almost automorphic and bijective factors of substitution shifts
In this article we completely characterise constant length substitution shifts which have a proper almost automorphic factor, or which have a bijective substitution factor such that the factor map is injective on at least one point. Our approach is algebraic: we characterise these dynamical properties in terms of a finite semigroup defined by the substitution. We characterise the existence of almost automorphic factors in terms of Green’s $${\mathcal {R}}$$ -relation and the existence of bijective factors in terms of Green’s $${{\mathcal {L}}}$$ -relation. Our results are constructive.- 16 January 2025
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 206 (3) , 507-549
Open AccessAlmost automorphic and bijective factors of substitution shifts
In this article we completely characterise constant length substitution shifts which have a proper almost automorphic factor, or which have a bijective substitution factor such that the factor map is injective on at least one point. Our approach is algebraic: we characterise these dynamical properties in terms of a finite semigroup defined by the substitution. We characterise the existence of almost automorphic factors in terms of Green’s $${\mathcal {R}}$$ -relation and the existence of bijective factors in terms of Green’s $${{\mathcal {L}}}$$ -relation. Our results are constructive. - 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
Obstacles to topological factoring of Toeplitz shifts
For every Toeplitz sequence $ x $ with period structure $ (q_i)_{i\geq 1} $, one can identify a period structure $ {\bf p} = (p_i)_{i\geq 0} $ which leads to a Bratteli-Vershik realization of the associated Toeplitz shift; we refer to this period structure as constructive. Let $ (X, \sigma, x) $ and $ (Y, \sigma, y) $ be Toeplitz shifts where $ x\in X $ and $ y\in Y $ are Toeplitz sequences with constructive period structures $ (p^n)_{n\geq 1} $ and $ (q^n)_{n\geq 1} $, respectively. Using the Bratteli-Vershik realization of factor maps between Toeplitz shifts, we prove that if there exists a topological factoring $ \pi:(X, \sigma)\rightarrow (Y, \sigma) $ with $ \pi(x) = y $, then $ q\mid p $. In particular, if $ \pi $ is conjugacy, then $ p = q $. We also prove that Toeplitz sequences are mapped to Toeplitz sequences through topological factorings onto shifts.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
Obstacles to topological factoring of Toeplitz shifts
For every Toeplitz sequence $ x $ with period structure $ (q_i)_{i\geq 1} $, one can identify a period structure $ {\bf p} = (p_i)_{i\geq 0} $ which leads to a Bratteli-Vershik realization of the associated Toeplitz shift; we refer to this period structure as constructive. Let $ (X, \sigma, x) $ and $ (Y, \sigma, y) $ be Toeplitz shifts where $ x\in X $ and $ y\in Y $ are Toeplitz sequences with constructive period structures $ (p^n)_{n\geq 1} $ and $ (q^n)_{n\geq 1} $, respectively. Using the Bratteli-Vershik realization of factor maps between Toeplitz shifts, we prove that if there exists a topological factoring $ \pi:(X, \sigma)\rightarrow (Y, \sigma) $ with $ \pi(x) = y $, then $ q\mid p $. In particular, if $ \pi $ is conjugacy, then $ p = q $. We also prove that Toeplitz sequences are mapped to Toeplitz sequences through topological factorings onto shifts.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Modern Dynamics
- Vol. 21, 271-325
Coboundaries and eigenvalues of finitary $ S $-adic systems
An $ S $-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary $ S $-adic dynamical system is one where the directive sequence consists of morphisms selected from a finite set. We study eigenvalues and coboundaries for finitary recognizable $ S $-adic dynamical systems, i.e., those where points can be uniquely desubstituted using the given sequence of morphisms. To do this we identify the notions of straightness and essential words, and use them to define a coboundary, inspired by Host's formalism, which allows us to express necessary and sufficient conditions that a complex number must satisfy in order to be a continuous or measurable eigenvalue. We then apply our results to finitary directive sequences of substitutions of constant length, and show how to create constant-length $ S $-adic shifts with non-trivial coboundaries. We show that in this case all continuous eigenvalues are rational and we give a complete description of the rationals that can be an eigenvalue, indicating how this leads to a Cobham-style result for these systems.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Modern Dynamics
- Vol. 21, 271-325
Coboundaries and eigenvalues of finitary $ S $-adic systems
An $ S $-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary $ S $-adic dynamical system is one where the directive sequence consists of morphisms selected from a finite set. We study eigenvalues and coboundaries for finitary recognizable $ S $-adic dynamical systems, i.e., those where points can be uniquely desubstituted using the given sequence of morphisms. To do this we identify the notions of straightness and essential words, and use them to define a coboundary, inspired by Host's formalism, which allows us to express necessary and sufficient conditions that a complex number must satisfy in order to be a continuous or measurable eigenvalue. We then apply our results to finitary directive sequences of substitutions of constant length, and show how to create constant-length $ S $-adic shifts with non-trivial coboundaries. We show that in this case all continuous eigenvalues are rational and we give a complete description of the rationals that can be an eigenvalue, indicating how this leads to a Cobham-style result for these systems.- Open Access
- 27 November 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 19 (1) , 393-394
Corrigendum to “The Ellis semigroup of bijective substitutions”
This corrigendum corrects the statement and proof of Theorem 3.6 of [Groups Geom. Dyn. 16, 29–73 (2022)].
- 27 November 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 19 (1) , 393-394
Open AccessCorrigendum to “The Ellis semigroup of bijective substitutions”
This corrigendum corrects the statement and proof of Theorem 3.6 of [Groups Geom. Dyn. 16, 29–73 (2022)].
- Open Access
A dynamical view of Tijdeman's solution of the chairman assignment problem
In 1980, R. Tijdeman provided an on-line algorithm that generates sequences over a finite alphabet with minimal discrepancy, that is, such that the occurrence of each letter optimally tracks its frequency. In this article, we define discrete dynamical systems generating these sequences. The dynamical systems are defined as exchanges of polytopal pieces, yielding cut and project schemes, and they code tilings of the line whose sets of vertices form model sets. We prove that these sequences of low discrepancy are natural codings of toral translations with respect to polytopal atoms, and that they generate a minimal and uniquely ergodic subshift with purely discrete spectrum. Finally, we show that the factor complexity of these sequences is of polynomial growth order $n^{d-1}$, where $d$ is the cardinality of the alphabet.Open AccessA dynamical view of Tijdeman's solution of the chairman assignment problem
In 1980, R. Tijdeman provided an on-line algorithm that generates sequences over a finite alphabet with minimal discrepancy, that is, such that the occurrence of each letter optimally tracks its frequency. In this article, we define discrete dynamical systems generating these sequences. The dynamical systems are defined as exchanges of polytopal pieces, yielding cut and project schemes, and they code tilings of the line whose sets of vertices form model sets. We prove that these sequences of low discrepancy are natural codings of toral translations with respect to polytopal atoms, and that they generate a minimal and uniquely ergodic subshift with purely discrete spectrum. Finally, we show that the factor complexity of these sequences is of polynomial growth order $n^{d-1}$, where $d$ is the cardinality of the alphabet. - Open Access
Coboundaries and eigenvalues of finitary S-adic systems
An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of morphisms selected from a finite set. We study eigenvalues and coboundaries for finitary recognizable S-adic dynamical systems, i.e., those where points can be uniquely desubstituted using the given sequence of morphisms. To do this we identify the notions of straightness and essential words, and use them to define a coboundary, inspired by of Host's formalism, which allows us to express necessary and sufficient conditions that a complex number must satisfy in order to be a continuous or measurable eigenvalue. We then apply our results to finitary directive sequences of substitutions of constant length, and show how to create constant-length $S$-adic shifts with non-trivial coboundaries. We show that in this case all continuous eigenvalues are rational and we give a complete description of the rationals that can be an eigenvalue, indicating how this leads to a Cobham-style result for these systems.
Open AccessCoboundaries and eigenvalues of finitary S-adic systems
An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of morphisms selected from a finite set. We study eigenvalues and coboundaries for finitary recognizable S-adic dynamical systems, i.e., those where points can be uniquely desubstituted using the given sequence of morphisms. To do this we identify the notions of straightness and essential words, and use them to define a coboundary, inspired by of Host's formalism, which allows us to express necessary and sufficient conditions that a complex number must satisfy in order to be a continuous or measurable eigenvalue. We then apply our results to finitary directive sequences of substitutions of constant length, and show how to create constant-length $S$-adic shifts with non-trivial coboundaries. We show that in this case all continuous eigenvalues are rational and we give a complete description of the rationals that can be an eigenvalue, indicating how this leads to a Cobham-style result for these systems.
- Open Access
- 18 August 2023
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 44 (5) , 1379-1417
Tame or wild Toeplitz shifts
We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli–Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular fibres over the maximal equicontinuous factor. The ideas are illustrated using the class of substitution shifts. A body of elaborate examples shows that the assumptions of our results cannot be relaxed.
- 18 August 2023
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 44 (5) , 1379-1417
Open AccessTame or wild Toeplitz shifts
We investigate tameness of Toeplitz shifts. By introducing the notion of extended Bratteli–Vershik diagrams, we show that such shifts with finite Toeplitz rank are tame if and only if there are at most countably many orbits of singular fibres over the maximal equicontinuous factor. The ideas are illustrated using the class of substitution shifts. A body of elaborate examples shows that the assumptions of our results cannot be relaxed.
- Open Access
Almost automorphic and bijective factors of substitution shifts
In this article we completely characterise constant length substitution shifts which have an almost automorphic factor, or which have a bijective substitution factor. Our approach is algebraic: we study these dynamical properties in terms of a finite semigroup defined by the substitution. We characterise the existence of almost automorphic factors in terms of Green's R-relation, and the existence of bijective factors in terms of Green's L-relation. Our results are constructive.
Open AccessAlmost automorphic and bijective factors of substitution shifts
In this article we completely characterise constant length substitution shifts which have an almost automorphic factor, or which have a bijective substitution factor. Our approach is algebraic: we study these dynamical properties in terms of a finite semigroup defined by the substitution. We characterise the existence of almost automorphic factors in terms of Green's R-relation, and the existence of bijective factors in terms of Green's L-relation. Our results are constructive.
- Open Access
Torsion-free $S$-adic shifts and their spectrum
In this work we study $S$-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant-length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of the lengths. We show that torsion-free directive sequences generate shifts that enjoy the property of quasi-recognizability which can be used as a substitute for recognizability. Indeed quasi-recognizable directive sequences can be replaced by a recognizable directive sequence. With this, we give a finer description of the spectrum of shifts generated by torsion-free sequences defined on a sequence of alphabets of bounded size, in terms of extensions of the notions of height and column number. We illustrate our results throughout with examples that explain the subtleties that can arise.
Open AccessTorsion-free $S$-adic shifts and their spectrum
In this work we study $S$-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant-length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of the lengths. We show that torsion-free directive sequences generate shifts that enjoy the property of quasi-recognizability which can be used as a substitute for recognizability. Indeed quasi-recognizable directive sequences can be replaced by a recognizable directive sequence. With this, we give a finer description of the spectrum of shifts generated by torsion-free sequences defined on a sequence of alphabets of bounded size, in terms of extensions of the notions of height and column number. We illustrate our results throughout with examples that explain the subtleties that can arise.