No positive cone in a free product is regular
Preprint
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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Groups with infinitely many ends are not fraction groupsGroups, Geometry, and Dynamics, 2015
- Conjugacy growth series and languages in groupsTransactions of the American Mathematical Society, 2013
- Explicit left orders on free groups extending the lexicographic order on free monoidsComptes Rendus Mathematique, 2013
- ORDERING GRAPH PRODUCTS OF GROUPSInternational Journal of Algebra and Computation, 2012
- Left-orderings on free products of groupsJournal of Algebra, 2012
- On the dynamics of (left) orderable groupsAnnales de l'institut Fourier, 2010
- GRAPH PRODUCTS AND CANNON PAIRSInternational Journal of Algebra and Computation, 2002
- Order automatic mapping class groupsPacific Journal of Mathematics, 2000