{"title":"Logistic映射的多项式熵","authors":"Milan Perić","doi":"10.1556/012.2021.58.2.1494","DOIUrl":null,"url":null,"abstract":"We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).","PeriodicalId":51187,"journal":{"name":"Studia Scientiarum Mathematicarum Hungarica","volume":"58 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial Entropy of the Logistic Map\",\"authors\":\"Milan Perić\",\"doi\":\"10.1556/012.2021.58.2.1494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).\",\"PeriodicalId\":51187,\"journal\":{\"name\":\"Studia Scientiarum Mathematicarum Hungarica\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studia Scientiarum Mathematicarum Hungarica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1556/012.2021.58.2.1494\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Scientiarum Mathematicarum Hungarica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1556/012.2021.58.2.1494","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).
期刊介绍：
The journal publishes original research papers on various fields of mathematics, e.g., algebra, algebraic geometry, analysis, combinatorics, dynamical systems, geometry, mathematical logic, mathematical statistics, number theory, probability theory, set theory, statistical physics and topology.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
