6 citations · 6 across the 11 of their papers we have counts for
3 papers · 1 filter
On the complexity of subshifts and infinite words
Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and gro…
Noncommutative point spaces of symbolic dynamical systems
Jason P. Bell, Be'eri Greenfeld
We study point modules of monomial algebras associated with symbolic dynamical systems, parametrized by proalgebraic varieties which 'linearize' the underlying dynamical systems. F…
Rank-stability of polynomial equations
Tomer Bauer, Guy Blachar, Be'eri Greenfeld
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approxi…