Skip to main content
MathOverflow
user158448's user avatar
user158448's user avatar
user158448's user avatar
user158448
  • Member for 4 years, 6 months
  • Last seen more than 3 years ago
Profile Activity

16 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Nice Question
awarded
 Supporter
revised
Computability of the "free envelope rank" of an endomorphism of a free group
added 122 characters in body
revised
Computability of the "free envelope rank" of an endomorphism of a free group
Type corrected. Added an idea to attack the problem.
revised
Computability of the "free envelope rank" of an endomorphism of a free group
added 4 characters in body
comment
Computability of the "free envelope rank" of an endomorphism of a free group
@YCor How would you define the iterates $\sigma^n(F)$ in that context?
revised
Computability of the "free envelope rank" of an endomorphism of a free group
added 67 characters in body
asked
Computability of the "free envelope rank" of an endomorphism of a free group
comment
If $(Y,T)$ is a connected minimal system with a symbolic extension of linear word complexity, is $(Y,T)$ equicontinuous?
I was thinking in lim sup: $$ p(n) \leq Cn,\quad \forall n\in\mathbb{N}$$ But a counterexample with $$ \liminf_{n\to\infty}p(n)/n < +\infty $$ it is also interesting for me.
comment
If $(Y,T)$ is a connected minimal system with a symbolic extension of linear word complexity, is $(Y,T)$ equicontinuous?
@DanRust Yes! I edited the question to make it clearer.
revised
If $(Y,T)$ is a connected minimal system with a symbolic extension of linear word complexity, is $(Y,T)$ equicontinuous?
added 18 characters in body
awarded
 Student
awarded
 Editor
revised
If $(Y,T)$ is a connected minimal system with a symbolic extension of linear word complexity, is $(Y,T)$ equicontinuous?
added 4 characters in body
asked
If $(Y,T)$ is a connected minimal system with a symbolic extension of linear word complexity, is $(Y,T)$ equicontinuous?
awarded
 Informed