Minimal generating set of the semigroup of partitioned binary relations

DOI10.1007/S00233-024-10491-1MaRDI QIDQ7028362zbMATH OpenFDO

Authors Chwas Abas Ahmed

Publication date 12 February 2025

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00233-024-10491-1

zbMATH Keywords

diagram monoidsgeneratorspartitioned binary relationrank of a semigroup

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20)

Review text

The paper aims at the problem of determining the size of a minimal generating set of a semigroup. The author here focuses on the comparison between the rank of the full transformation semigroup and the partition monoid of degree $n$ and that of the semigroup of binary relations. The first one does not depend on $n$ whereas the latter one increases exponentially with $n$. In this paper, the author proves that the rank of the semigroup of partitioned binary relations also increases exponentially with $n$. The results proved here are insightful and the methodologies employed are explained with suitable diagrams. The paper may be much more better with the insertion of examples and counter examples in appropriate places. A resourceful reference list is given at the end of the paper.

Cites work

• A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
• A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
• Classical finite transformation semigroups. An introduction.
• Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals
• Generating wreath products of symmetric and alternating groups
• Generators and relations for partition monoids and algebras.
• scientific article; zbMATH DE number 5310367 (Why is no real title available?)
• scientific article; zbMATH DE number 3656179 (Why is no real title available?)
• scientific article; zbMATH DE number 50597 (Why is no real title available?)
• scientific article; zbMATH DE number 53657 (Why is no real title available?)
• scientific article; zbMATH DE number 1296970 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• scientific article; zbMATH DE number 3353590 (Why is no real title available?)
• Hybrid polynomial approximation to higher derivatives of rational curves
• Idempotent rank in finite full transformation semigroups
• Maximal subgroups of the semigroup of relations
• Minimal generating sets for matrix monoids
• On algebras which are connected with the semisimple continuous groups.
• On the minimal size of a generating set of lattices in Lie groups
• On the ranks of certain finite semigroups of transformations
• On the ranks of certain semigroups of order-preserving transformations
• On the semigroup rank of a group
• On the structure of semigroups
• Partition monoids and embeddings in 2-generator regular \(*\)-semigroups.
• Partitioned binary relations
• Ranks of ideals in inverse semigroups of difunctional binary relations
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• TEMPERLEY-LIEB ALGEBRAS FOR NON-PLANAR STATISTICAL MECHANICS — THE PARTITION ALGEBRA CONSTRUCTION
• The idempotent-generated subsemigroup of the Kauffman monoid
• The minimal number of generators of a finite semigroup.

This page was built for publication: Minimal generating set of the semigroup of partitioned binary relations

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