Computing finite commutative semigroups. III.

MaRDI QIDQ1423716zbMATH OpenFDO

Authors Pierre Antoine Grillet

Publication date 7 March 2004

Published in Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

algorithmscommutative semigroupsnumbers of semigroupsprecedenceprofiles

Mathematics Subject Classification ID

Commutative semigroups (20M14) Symbolic computation and algebraic computation (68W30)

Review text

The author treats commutative semigroups in case having no zero while the previous paper [with the same title, part II, ibid. 67, No. 2, 159-184 (2003; Zbl 1064.20059)] did the case having zero. The basic principle of the method is almost the same as in part II, precedence, weak precedence, subprecedence, deny (confirm) the precedence, profile. The author says, in the abstract, new precedence results are obtained for semigroups without zero, which describes the first row in detail. The results are very useful.

Recommendations

• Computing finite commutative semigroups. II.
• Computing finite semigroups. II: The first nonconstant row
• Computing finite commutative semigroups
• Computing finite semigroups. I: The first row.
• The number of commutative semigroups of order \(n\)

Cited in

(8)

• Computing finite commutative semigroups. II.
• The number of commutative semigroups of order \(n\)
• Computing finite commutative semigroups
• scientific article; zbMATH DE number 3859412 (Why is no real title available?)
• Computing denumerants in numerical 3-semigroups
• On rectangular ideal extensions of left zero semigroups by null semigroups
• Computing finite semigroups. I: The first row.
• Computing finite semigroups. II: The first nonconstant row

This page was built for publication: Computing finite commutative semigroups. III.

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