Abstract
We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised in [9, Question 5.1].Our construction goes through a construction of finitely generated just-infinite, primitive monomial algebras with prescribed growth type, from which we construct uniformly recurrent infinite words with subword complexity having the same growth type.We also discuss the connection between entropy of algebras and their homomorphic images, as well as the degrees of their generators of free subalgebras.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
