Finite binary relations have no more complexity than finite functions

DOI10.1007/BF02315969zbMath0294.20057OpenAlexW2022613966MaRDI QIDQ1212557

S. Singh

Publication date: 1974

Published in: Semigroup Forum (Search for Journal in Brave)

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

Mathematics Subject Classification ID

General structure theory for semigroups (20M10)

Related Items (5)

Idempotent Boolean matrices ⋮ Representation theory of finite semigroups over semirings. ⋮ Another semigroup of complexity \(n-1\) ⋮ A reduction theorem for complexity of finite semigroups ⋮ The group-theoretic complexity of subsemigroups of Boolean matrices

Cites Work

• Unnamed Item
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Some results on finite semigroups
• Maximal subgroups of the semigroup of relations
• Groups of binary relations
• A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
• Decomposition and complexity of finite semigroups
• A generalization of the Rees theorem to a class of regular semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Homomorphisms of semigroups of binary relations
• Lower bounds for complexity of finite semigroups
• The Schützenberger group of an H-class in the semigroup of binary relations
• Idempotents and product representations with applications to the semigroup of binary relations
• The fundamental lemma of complexity for arbitrary finite semigroups
• On the semigroup of binary relations

This page was built for publication: Finite binary relations have no more complexity than finite functions