Interval orders, semiorders and ordered groups
Combinatorics
2018-04-19 v2
Abstract
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection of intervals of some totally ordered abelian group, these intervals being of the form for some positive . We describe ordered groups such that the ordering is a semiorder and we introduce threshold groups generalizing totally ordered groups. We show that the free group on finitely many generators and the Thompson group can be equipped with a compatible semiorder which is not a weak order. On another hand, a group introduced by Clifford cannot.
Cite
@article{arxiv.1706.03276,
title = {Interval orders, semiorders and ordered groups},
author = {Maurice Pouzet and Imed Zaguia},
journal= {arXiv preprint arXiv:1706.03276},
year = {2018}
}
Comments
32 pages, 2 figures