Results 201 to 210 of about 108,334 (223)
Some of the next articles are maybe not open access.

Semigroup algebras of finite ample semigroups

Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 2012
An adequate semigroup S is called ample if ea = a(ea)* and ae = (ae)†a for all a ∈ S and e ∈ E(S). Inverse semigroups are exactly those ample semigroups that are regular. After obtaining some characterizations of finite ample semigroups, it is proved that semigroup algebras of finite ample semigroups have generalized triangular matrix representations ...
Guo, Xiaojiang, Chen, Lin
openaire   +1 more source

Generalized Bicyclic Semigroups and Jones Semigroups

Southeast Asian Bulletin of Mathematics, 2001
A classic result of Anderson is that if a simple, but not completely simple, semigroup \(S\) contains an idempotent, then it contains a copy of the bicyclic monoid \(B=\langle a,b\mid ab=1\rangle\). The reviewer [Proc. R. Soc. Edinb., Sect. A 106, 11-24 (1987; Zbl 0626.20047)] showed that if such a semigroup is idempotent-free and Green's relation ...
Yu, Bingjun, Jiang, Qifen
openaire   +3 more sources

Ternary semigroups

Semigroup Forum, 2010
A regularity condition on a ternary semigroup is introduced and some properties of regular ternary semigroups are investigated. A semigroup called cover of a ternary semigroup is constructed and some of its properties are studied.
Santiago, M. L., Sri Bala, S.
openaire   +2 more sources

Canonical semigroups

Semigroup Forum, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

*-orderable semigroups

Semigroup Forum, 2009
A semigroup algebra \(kS\) admits a total ordering if and only if the field \(k\) is formally real and \(S\) is a cancellative orderable semigroup. The case of \(*\)-orderability of \(kS\) is much harder. The notion of a \(*\)-ordering has been extended from division rings to general noncommutative rings in a series of papers by \textit{M.
Klep, Igor, Moravec, Primož
openaire   +2 more sources

Home - About - Disclaimer - Privacy