{"title":"无穷字母表上有界自动机群的可篡改性","authors":"Bernhard Reinke","doi":"10.1112/blms.13065","DOIUrl":null,"url":null,"abstract":"<p>We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first-level action. This criterion is a natural extension of the result that all groups generated by bounded activity automata with finite alphabets are amenable. Our motivation comes from the investigation of iterated monodromy groups of entire transcendental functions in holomorphic dynamics.</p>","PeriodicalId":55298,"journal":{"name":"Bulletin of the London Mathematical Society","volume":"56 7","pages":"2460-2471"},"PeriodicalIF":0.8000,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1112/blms.13065","citationCount":"0","resultStr":"{\"title\":\"Amenability of bounded automata groups on infinite alphabets\",\"authors\":\"Bernhard Reinke\",\"doi\":\"10.1112/blms.13065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first-level action. This criterion is a natural extension of the result that all groups generated by bounded activity automata with finite alphabets are amenable. Our motivation comes from the investigation of iterated monodromy groups of entire transcendental functions in holomorphic dynamics.</p>\",\"PeriodicalId\":55298,\"journal\":{\"name\":\"Bulletin of the London Mathematical Society\",\"volume\":\"56 7\",\"pages\":\"2460-2471\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1112/blms.13065\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the London Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1112/blms.13065\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the London Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1112/blms.13065","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Amenability of bounded automata groups on infinite alphabets
We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first-level action. This criterion is a natural extension of the result that all groups generated by bounded activity automata with finite alphabets are amenable. Our motivation comes from the investigation of iterated monodromy groups of entire transcendental functions in holomorphic dynamics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
