We study ordered groups in the context of both algebra and computability. Ordered groups are groups that admit a linear order that is compatible with the group operation. We explore some properties of ordered groups and discuss some related topics. We prove results about the semidirect product in relation to orderability and computability. In particular, we give a criteria for when a semidirect product of orderable groups is orderable and for when a semidirect product is computably categorical. We also give an example of a semidirect product that has the halting set coded into its multiplication structure but it is possible to construct a computable presentation of this semidirect product.

We examine a family of orderable groups that admit exactly countably many orders and show that their space of orders has arbitrary finite Cantor–Bendixson rank. Furthermore, this family of groups is also shown to be computably categorical, which in particular will allow us to conclude that any computable presentation of the groups does not admit any noncomputable orders. Lastly, we construct an example of an orderable computable group with no computable Archimedean orders but at least one computable non-Archimedean order.

Abstract prepared by Waseet Kazmi.

E-mail: [email protected]

URL: http://hdl.handle.net/11134/20002:860745910

Downey and Kurtz asked whether every orderable computable group is classically isomorphic to a group with a computable ordering. By an order on a group, one might mean either a left-order or a bi-order. We answer their question for left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order. The case of bi-orderable groups is left open.

Recently, Freiman et al. [‘Small doubling in ordered groups’, J. Aust. Math. Soc. 96(3) (2014), 316–325] proved two ‘structure theorems’ for ordered groups. We give elementary proofs of these two theorems.

We prove that if $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}S$ is a finite subset of an ordered group that generates a nonabelian ordered group, then $|S^2|\geq 3|S|-2$. This generalizes a classical result from the theory of set addition.

We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality and dp-minimality. In some classes of algebraic theories, however, we show that convex orderability and VC-minimality are equivalent, and use this to give a complete classification of VC-minimal theories of ordered groups and abelian groups. Consequences for fields are also considered, including a necessary condition for a theory of valued fields to be quasi-VC-minimal. For example, the p-adics are not quasi-VC-minimal.

Generalizing and strengthening some well-known results of Higman, B. Neumann, Hanna Neumann and Dark on embeddings into two-generator groups, we introduce a construction of subnormal verbal embedding of an arbitrary (soluble, fully ordered or torsion free) ordered countable group into a twogenerator ordered group with these properties. Further, we establish subnormal verbal embedding of defect two of an arbitrary (soluble, fully ordered or torsion free) ordered group G into a group with these properties and of the same cardinality as G, and show in connection with a problem of Heineken that the defect of such an embedding cannot be made smaller, that is, such verbal embeddings of ordered groups cannot in general be normal.