{"title":"足够大秩的自由幂零群$l\\geqslant 2$的子群隶属问题的不可判定性","authors":"Vitalii Anatol'evich Roman'kov","doi":"10.4213/im9342e","DOIUrl":null,"url":null,"abstract":"An answer is given to the question of M. Lohrey and B. Steinberg on decidability of the submonoid membership problem for a finitely generated nilpotent group. Namely, a finitely generated submonoid of a free nilpotent group of class $2$ of sufficiently large rank $r$ is constructed, for which the membership problem is algorithmically undecidable. This implies the existence of a submonoid with similar property in any free nilpotent group of class $l \\geqslant 2$ of rank $r$. The proof is based on the undecidability of Hilbert's tenth problem.","PeriodicalId":54910,"journal":{"name":"Izvestiya Mathematics","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Undecidability of the submonoid membership problem for free nilpotent group of class $l\\\\geqslant 2$ of sufficiently large rank\",\"authors\":\"Vitalii Anatol'evich Roman'kov\",\"doi\":\"10.4213/im9342e\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An answer is given to the question of M. Lohrey and B. Steinberg on decidability of the submonoid membership problem for a finitely generated nilpotent group. Namely, a finitely generated submonoid of a free nilpotent group of class $2$ of sufficiently large rank $r$ is constructed, for which the membership problem is algorithmically undecidable. This implies the existence of a submonoid with similar property in any free nilpotent group of class $l \\\\geqslant 2$ of rank $r$. The proof is based on the undecidability of Hilbert's tenth problem.\",\"PeriodicalId\":54910,\"journal\":{\"name\":\"Izvestiya Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Izvestiya Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4213/im9342e\",\"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":"Izvestiya Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4213/im9342e","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
An answer is given to the question of M. Lohrey and B. Steinberg on decidability of the submonoid membership problem for a finitely generated nilpotent group. Namely, a finitely generated submonoid of a free nilpotent group of class $2$ of sufficiently large rank $r$ is constructed, for which the membership problem is algorithmically undecidable. This implies the existence of a submonoid with similar property in any free nilpotent group of class $l \geqslant 2$ of rank $r$. The proof is based on the undecidability of Hilbert's tenth problem.
期刊介绍:
The Russian original is rigorously refereed in Russia and the translations are carefully scrutinised and edited by the London Mathematical Society. This publication covers all fields of mathematics, but special attention is given to:
Algebra;
Mathematical logic;
Number theory;
Mathematical analysis;
Geometry;
Topology;
Differential equations.