Modular posets and semigroups

DOI10.1007/BF02574120MaRDI QIDQ1916038zbMATH OpenOpenAlexFDO

Publication date 27 October 1996

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/135469

\(\text{modular}^*\) semigroup groupoids assigned to posets modular lattices pogroupoid posets assigned to groupoids semigroup

Mathematics Subject Classification ID

Partial orders, general (06A06) Modular lattices, Desarguesian lattices (06C05) General structure theory for semigroups (20M10) Sets with a single binary operation (groupoids) (20N02)

Review text

The paper studies posets assigned to groupoids (in particular to semigroups) and groupoids assigned to posets. A groupoid \(S (\cdot)\) is a pogroupoid, if \(x \cdot y \in \{x,y\}\), \(x \cdot (y \cdot x) = y \cdot x\) and \((x \cdot y) \cdot (y \cdot z) = (x \cdot y) \cdot z\) for any elements \(x,y,z\) of \(S\). A partial order \(\text{po} (S)\) associated with \(S\) is defined by \(x \leq y\) iff \(y \cdot x = y\). For a given poset \(S (\leq)\) a binary operation may be defined by \(y \cdot x = y\) for \(x \leq y\) and \(y \cdot x = x\) otherwise; the resulting groupoid is the pogroupoid \(\text{pogr} (S)\). If \(S\) is a semigroup, then an ordering \(\prec\) is defined so that \(x \prec y\) iff \(x \neq y\) and \(x \cdot y = y \cdot x = y\); the resulting poset is \(\text{po}^* (S)\). If \(\text{pogr(po}^* (S)) = S\), then \(S\) is called a \(\text{modular}^*\) semigroup. The conditions for a semigroup to be \(\text{modular}^*\) are investigated. A connection with modular lattices is shown.

Recommendations

Cites work

Cited in

(15)

This page was built for publication: Modular posets and semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916038)