arXiv subjects
Publications and source records attributed to A. M. W. Glass.
Let $(Ω, \leq)$ be a totally ordered set. We prove that if Aut$(Ω,\leq)$ is transitive and satisfies the same first-order sentences as the automorphism group of the real line (in the language of groups) then $Ω$ and and the real line are isomorphic ordered sets. This improvement of a theorem of Gurevich and Holland is obtained as a consequence of a study of centralizers associated with certain transitive subgroups of Aut$(Ω,\leq)$.
Let $(Ω, \leq)$ be a totally ordered set. We prove that if $\Aut(Ω,\leq)$ is transitive and satisfies the same first-order sentences as $\Aut(\RR,\leq)$ (in the language of lattice-ordered groups) then $Ω$ and $\RR$ are isomorphic ordered sets. This improvement of a theorem of Gurevich and Holland is obtained as one of many consequences of a study of centralizers and coloured chains associated with certain transitive subgroups of $\Aut(Ω,\leq)$.
Let $G=< x,t\mid w>$ be a one-relator group, where $w$ is a word in $x,t$. If $w$ is a product of conjugates of $x$ then, associated with $w$, there is a polynomial $A_w(X)$ over the integers, which in the case when $G$ is a knot group, is the Alexander polynomial of the knot. We prove, subject to certain restrictions on $w$, that if all roots of $A_w(X)$ are real and positive then $G$ is bi-orderable, and that if $G$ is bi-orderable then at least one root is real and positive. This sheds light on the bi-orderability of certain knot groups and on a question of Clay and Rolfsen. One of the results relies on an extension of work of G. Baumslag on adjunction of roots to groups, and this may have independent interest.
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
We provide a list of (mainly unsolved) problems in ordered and orderable groups. These were originally compiled 10 years ago by the last two authors. New problems have been added to the list. Progress on some of these is noted and references provided. A few have been solved and their solutions are noted and referenced. We hope that this submission will act as a spur to mathematicians to solve some of them!
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for lattice-ordered groups: Theorem: A finitely generated lattice-ordered group has soluble word problem if and only if it can be embedded in an simple lattice-ordered group that can be embedded in a finitely presented lattice-ordered group. The proof uses permutation groups and the ideas used to prove the lattice-ordered group analogue of Higman's Embedding Theorem.