Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Groups (possibly semigroups) endowed with possibly left/right/bi-invariant partial/total orderings. Study of such orders on groups.
12
votes
1
answer
466
views
Bi-orderability of Baumslag-Solitar group $\langle a,b \mid a^{-1} b^m a = b^n\rangle$ and o...
We say that a group $(A, \cdot)$ is bi-orderable if there exists a total order $\preceq$ on $A$ such that $xz \prec yz$ and $zx \prec zy$ for all $x,y,z \in A$ with $x \prec y$.
Let $m,n$ be non-zero …
7
votes
2
answers
538
views
A linearly orderable monoid which does not embed into a linearly orderable group
It is known (after an example of A.I. Mal'cev) that there exist cancellative semigroups which do not embed into a group. On the other hand, it is not difficult to see that every linearly orderable sem …
4
votes
2
answers
383
views
Embedding a linearly ordered free monoid into a linearly ordered group
A linearly ordered (shortly, l.o.) monoid is a triple $\mathbb M = (M, \cdot, \le)$ for which $(M, \cdot)$ is a (multiplicatively written) monoid and $\le$ is a total order on $M$ such that $xy < xz$ …
4
votes
1
answer
505
views
Strictly totally ordered semigroups - Looking for references
Let $\mathfrak A = (A, \cdot)$ be a semigroup (written multiplicatively). We say that $\mathfrak A$ is linearly orderable if there exists a total order $\le$ on $A$ such that $ac < bc$ and $ca < cb$ f …
4
votes
2
answers
1k
views
Every abelian torsion-free group is strictly totally orderable (via the compactness theorem)
Let $\mathbb G = (G, +)$ be a group. We say that $\mathbb G$ is strictly totally orderable (others would say bi-orderable) if there exists a total order $\preceq$ on $G$ such that $x+z \prec y + z$ an …
2
votes
What's a non-abelian totally ordered group?
Not really an example (see the edit below), but somehow related to Greg Kuperberg's one: Let $\mathbb A = (A, +, \cdot, \preceq)$ be a strictly totally orderable semiring (*) and for a fixed integer $ …
1
vote
1
answer
392
views
Is $x + y \ne y+nx$ for $x \ne 0$ and $n \ge 2$ (in an ordered group)?
Let $(A, +, \preceq)$ be an ordered group, namely $(A, +)$ is a group and $\preceq$ is a total order on $A$ such that $x + z \prec y + z$ and $z + x \prec z + y$ for all $x,y,z \in A$ with $x \prec y$ …