Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Formal language convexity in left-orderable groups

    https://doi.org/10.1142/S0218196720500472Cited by:3 (Source: Crossref)

    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 k generators, for every k3. As a special case of our construction, we obtain a finitely generated positive cone for F2×.

    Communicated by J. Meakin

    AMSC: 20F65, 06F15
    Remember to check out the Most Cited Articles!

    Check out Algebra & Computation books in the Mathematics 2021 catalogue.