3 citations · 9 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.DS2022★ 1 cited
Finding lower bounds on the growth and entropy of subshifts over countable groups
Matthieu Rosenfeld
We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based o…
cs.DM2022
It is undecidable whether the growth rate of a given bilinear system is 1
Matthieu Rosenfeld
We show that there exists no algorithm that decides for any bilinear system if the growth rate of is . This answers a question of Bui who showed that if the coef…