Combinatorial properties of binary semigroups
From MaRDI portal
Publication:1843652
DOI10.1007/BF02018162zbMath0281.20052MaRDI QIDQ1843652
Publication date: 1974
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) General structure theory for semigroups (20M10) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Other combinatorial set theory (03E05) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items
The publications of Ki Hang Kim, Inverse elements and their average number in a finite symmetric semigroup, The lattice of idempotent binary relations, Die D-Klassen der endlichen symmetrischen Halbgruppen und ihre Mächtigkeiten, The semigroup of Hall relations, Inverses of Boolean matrices, The algebraic structure of the semigroup of binary relations on a finite set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Canonical bijection between \(D\)-classes of (0,1)-matrix semigroups
- Maximal subgroups of the semigroup of relations
- Relation algebras and function semigroups
- Groups of binary relations
- A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
- On \((0.1)\)-matrix semigroups
- The number of partially ordered sets
- The number of idempotents in (0,1)-matrix semigroups
- Green's relations in finite function semigroups
- Cardinalities of \(D\)-classes in B\(_n\)
- On semigroups of Boolean ring endomorphisms
- Idempotents and product representations with applications to the semigroup of binary relations
- Automorphisms of the Semigroup of all Relations on a Set
- The number of idempotent elements in symmetric semigroups
- Cardinality of finite topologies
- On the computer enumeration of finite topologies
- A characterization of idempotents in semigroups
- Zero-free fortifying homomorphisms and semigroups of relations
- Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups
- Some combinatorial properties of transformations and their connections with the theory of graphs
- Union and symmetry preserving endomorphisms of the semigroup of all binary relations on a set
- Translational hull and semigroups of binary relations
- On a sharp estimation in the theory of binary relations on a finite set
- On idempotent binary relations on a finite set
- On the semigroup of binary relations on a finite set
- A Note on a Generalization of Boolean Matrix Theory
- Relations binaires, fermetures, correspondances de Galois
- The Number of Structures of Finite Relations
