Virtually free groups are stable in permutations

Pub Date : 2021-03-09 DOI:10.4171/ggd/735
Nir Lazarovich, Arie Levit
{"title":"Virtually free groups are stable in permutations","authors":"Nir Lazarovich, Arie Levit","doi":"10.4171/ggd/735","DOIUrl":null,"url":null,"abstract":"We prove that finitely generated virtually free groups are stable in permutations. As an application, we show that almost-periodic almost-automorphisms of labelled graphs are close to periodic automorphisms.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4171/ggd/735","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We prove that finitely generated virtually free groups are stable in permutations. As an application, we show that almost-periodic almost-automorphisms of labelled graphs are close to periodic automorphisms.
分享
查看原文
几乎自由的群在排列中是稳定的
我们证明了有限生成的虚拟自由群在置换中是稳定的。作为一个应用,我们证明了标记图的概周期概自同构接近于周期自同构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信