由同伴旅行者性质判伪蕴含测地自可栈性
群论
2022-12-07 v2
摘要
已知具有由同伴旅行者性质判伪的群有可解字问题，但尚不知它们是否为自动机或具有有限收敛重写系统。在本文中，我们证明这些群承认这两个性质的推广；即它们是测地自可栈的。作为证明这一点的关键部分，我们证明了一类更广泛的群，即具有权非增同步正则收敛前缀重写系统的群，具有有界正则收敛前缀重写系统。
引用
@article{arxiv.2209.11912,
title = {The falsification by fellow traveler property implies geodesic autostackability},
author = {Ash DeClerk},
journal= {arXiv preprint arXiv:2209.11912},
year = {2022}
}
备注
22 pages, 4 figures. Extended Theorem A to find autostackable structures for groups with weight non-increasing (as opposed to length non-increasing) CP-RSs, along with minor edits for typos and clarity