有限生成群空间子集的描述复杂度

IF 0.8 4区数学 Q2 MATHEMATICS

Expositiones Mathematicae Pub Date : 2022-12-01 DOI:10.1016/j.exmath.2022.08.001

Mustafa Gökhan Benli̇, Burak Kaya

{"title":"有限生成群空间子集的描述复杂度","authors":"Mustafa Gökhan Benli̇, Burak Kaya","doi":"10.1016/j.exmath.2022.08.001","DOIUrl":null,"url":null,"abstract":"<div>In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are <math><msubsup><mrow><mi>Σ</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math>-complete and that the sets of periodic groups and groups of intermediate growth are <math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math>-complete. We also provide bounds for the descriptive complexity of simplicity, amenability, residually finiteness, Hopficity and co-Hopficity. This paper is intended to serve as a compilation of results on this theme.</div>","PeriodicalId":50458,"journal":{"name":"Expositiones Mathematicae","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Descriptive complexity of subsets of the space of finitely generated groups\",\"authors\":\"Mustafa Gökhan Benli̇, Burak Kaya\",\"doi\":\"10.1016/j.exmath.2022.08.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are <math><msubsup><mrow><mi>Σ</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math>-complete and that the sets of periodic groups and groups of intermediate growth are <math><msubsup><mrow><mi>Π</mi></mrow><mrow><mn>2</mn></mrow><mrow><mn>0</mn></mrow></msubsup></math>-complete. We also provide bounds for the descriptive complexity of simplicity, amenability, residually finiteness, Hopficity and co-Hopficity. This paper is intended to serve as a compilation of results on this theme.</div>\",\"PeriodicalId\":50458,\"journal\":{\"name\":\"Expositiones Mathematicae\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Expositiones Mathematicae\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0723086922000494\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expositiones Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0723086922000494","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 3

摘要

本文确定了由各种群论性质所定义的标记群的波兰空间的子集的描述复杂度。特别地，利用Grigorchuk群，我们建立了可解群、指数增长群和可决字问题群的集合为Σ20-complete，周期群和中间增长群的集合为Π20-complete。我们还给出了简单性、适应性、剩余有限性、合性和共合性的描述复杂性的界。本文旨在汇编关于这一主题的研究结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Descriptive complexity of subsets of the space of finitely generated groups

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are $Σ_{2}^{0}$ -complete and that the sets of periodic groups and groups of intermediate growth are $Π_{2}^{0}$ -complete. We also provide bounds for the descriptive complexity of simplicity, amenability, residually finiteness, Hopficity and co-Hopficity. This paper is intended to serve as a compilation of results on this theme.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Expositiones Mathematicae 数学-数学

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

40 days

期刊介绍： Our aim is to publish papers of interest to a wide mathematical audience. Our main interest is in expository articles that make high-level research results more widely accessible. In general, material submitted should be at least at the graduate level.Main articles must be written in such a way that a graduate-level research student interested in the topic of the paper can read them profitably. When the topic is quite specialized, or the main focus is a narrow research result, the paper is probably not appropriate for this journal. Most original research articles are not suitable for this journal, unless they have particularly broad appeal.Mathematical notes can be more focused than main articles. These should not simply be short research articles, but should address a mathematical question with reasonably broad appeal. Elementary solutions of elementary problems are typically not appropriate. Neither are overly technical papers, which should best be submitted to a specialized research journal.Clarity of exposition, accuracy of details and the relevance and interest of the subject matter will be the decisive factors in our acceptance of an article for publication. Submitted papers are subject to a quick overview before entering into a more detailed review process. All published papers have been refereed.