3 papers
math.RA2026
Amenability is not sensitive to the base field
Be'eri Greenfeld
We prove that the notion of amenability of a (module over) an associative algebra does not depend on the ground field, answering a question proposed by Cornulier in a MathOverflow…
math.DS2025
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…
math.RA2025
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…