Papers
Topics
Authors
Recent
Search
2000 character limit reached

No positive cone in a free product is regular

Published 20 Sep 2016 in math.GR | (1609.06288v2)

Abstract: We show that there exists no left order on the free product of two nontrivial, finitely generated, left-orderable groups such that the corresponding positive cone is represented by a regular language. Since there are orders on free groups of rank at least two with positive cone languages that are context-free (in fact, 1-counter languages), our result provides a bound on the language complexity of positive cones in free products that is the best possible within the Chomsky hierarchy. It also provides a strengthening of a result by Cristobal Rivas stating that the positive cone in a free product of nontrivial, finitely generated, left-orderable groups cannot be finitely generated as a semigroup.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.