PropertyValue
?:abstract
  • Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we show that there cannot exist a general upper bound on the lower measure-theoretic slow entropy for systems of finite rank. Moreover, we prove flexibility results for the values of upper and lower polynomial slow entropy of rigid transformations as well as maps admitting a good cyclic approximation.
is ?:annotates of
?:arxiv_id
  • 2010.14472
?:creator
?:externalLink
?:license
  • arxiv
?:pdf_json_files
  • document_parses/pdf_json/769efed9f53250addfb8d008cedde34433fc5b95.json
?:publication_isRelatedTo_Disease
?:sha_id
?:source
  • ArXiv
?:title
  • Slow entropy of some combinatorial constructions
?:type
?:year
  • 2020-10-27

Metadata

Anon_0  
<http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/net/provenance/ns#DataItem>
<http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2004/03/trix/rdfg-1/Graph>
<http://xmlns.com/foaf/0.1/primaryTopic> <https://research.tib.eu/covid-19/entity/sc0u8ekp>
<http://xmlns.com/foaf/0.1/topic> Anon_0
<http://www.ontologydesignpatterns.org/cp/owl/informationrealization.owl#realizes> <https://research.tib.eu/covid-19/data/entity/sc0u8ekp>
<http://purl.org/net/provenance/ns#createdBy>
Anon_1   (more)
expand all