OFFSET
0,3
COMMENTS
A posemigroup (partially ordered semigroup) is a triple (S, *, <=) where (S, <=) is a partial order, (S, *) is a semigroup (associative binary operation), and * is monotone with respect to <=: for all a, b, x in S, if a <= b then a*x <= b*x and x*a <= x*b.
LINKS
Petr Gajdoš and Martin Kuřil, Ordered semigroups of size at most 7 and linearly ordered semigroups of size at most 10, Semigroup Forum, 89 (2014), 639-663.
EXAMPLE
a(0) = 0 for n = 0, the unique posemigroup is the empty structure which vacuously satisfies all axioms.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Firdous Ahmad Mala, Mar 17 2026
STATUS
approved
