Formal language convexity in left-orderable groups
Group Theory
2020-04-28 v2
Abstract
We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes to its finite index subgroups, and to show that there exists no left order on a finitely generated acylindrically hyperbolic group such that the corresponding positive cone is represented by a quasi-geodesic regular language. We also answer one of Navas' questions by giving an example of an infinite family of groups which admit a positive cone that is generated by exactly generators, for every . As a special case of our construction, we obtain a finitely generated positive cone for .
Cite
@article{arxiv.1905.13001,
title = {Formal language convexity in left-orderable groups},
author = {Hang Lu Su},
journal= {arXiv preprint arXiv:1905.13001},
year = {2020}
}
Comments
17 pages