activity
20012026
most citedRecognizability for sequences of morphisms

50 citations · 122 across the 35 of their papers we have counts for

collaborators

41 papers

math.DS2026

From some Pisot numerations to topological groups

Olivier Carton, Jake Sudbery, Reem Yassawi

A Pisot numeration system for is a sequence of natural numbers generated by an integral homogeneous linear recurrence whose characteristic polynomial is the minimal…

math.DS2026

When is the Ellis semigroup a complete conjugacy invariant?

Johannes Kellendonk, Reem Yassawi

The Ellis semigroup of a topological dynamical system contains algebraic, topological and dynamical information. It is invariant under conjugacy. Despite this wealth of structure,…

math.NT2025

Cobham's theorem for the Gaussian integers

Álvaro Bustos-Gajardo, Robbert Fokkink, Reem Yassawi

Assuming the four exponentials conjecture, Hansel and Safer showed that if a subset of the Gaussian integers is both - and -recognizable, then it is syndetic,…

math.DS2024

Obstacles to Topological Factoring of Toeplitz shifts

Maryam Hosseini, Reem Yassawi

For every Toeplitz sequence with period structure , one can identify a period structure which leads to a Bratteli-Vershik realization…

math.NT2024

Algebraic power series and their automatic complexity modulo prime powers

Eric Rowland, Reem Yassawi

Christol and, independently, Denef and Lipshitz showed that an algebraic sequence of -adic integers (or integers) is -automatic when reduced modulo . Previously, the bes…

math.DS2024★ 2 cited

A dynamical view of Tijdeman's solution of the chairman assignment problem

Valérie Berthé, Olivier Carton, Nicolas Chevallier +2

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 optima…