Semigroups generated by partitions
From MaRDI portal
Publication:5227539
zbMATH Open1473.20068arXiv1901.06126MaRDI QIDQ5227539FDOQ5227539
Authors: Aleksey A. Dovgoshey
Publication date: 6 August 2019
Abstract: Let be a nonempty set and be the Cartesian square of . Some semigroups of binary relations generated partitions of are studied. In particular, the algebraic structure of semigroups generated by the finest partition of and, respectively, by the finest symmetric partition of are described.
Full work available at URL: https://arxiv.org/abs/1901.06126
Recommendations
- Generated sets of the complete semigroup binary relations defined by semilattices of the finite chains
- Irreducible generating sets of complete semigroups of unions \(B_x(D)\) defined by semilattices of the class \(\Sigma_2(X,4)\)
- scientific article
- Automorphisms of filters: a selection of open problems
- scientific article; zbMATH DE number 3340263
Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of equivalence relations
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in graph theory. Graphs and their Cartesian product
- Regular elements of the semigroup of all binary relations
- Inverses of Boolean matrices
- Right units in complete semigroups of binary relations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lattices, equivalence relations, and subgroups
- 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
- Title not available (Why is that?)
- Every semigroup is isomorphic to a transitive semigroup of binary relations
- Operations on binary relations and their applications
- On the semigroup of binary relations
- Idempotent Boolean matrices
- Reduced idempotents in the semigroup of Boolean matrices
- Title not available (Why is that?)
- Any group is a maximal subgroup of the semigroup of binary relations on some set
- A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homomorphisms of semigroups of binary relations
- Title not available (Why is that?)
- Generated sets of the complete semigroup binary relations defined by semilattices of the finite chains
- One-sided units for subsets of the semigroup of binary relations
- One-sided zeros of subsets of the semigroup of binary relations
Cited In (10)
- When all permutations are combinatorial similarities
- Combinatorial characterization of pseudometrics
- Combinatorial properties of ultrametrics and generalized ultrametrics
- ON THE PARTITION MONOID AND SOME RELATED SEMIGROUPS
- Subgeometry partitions from cyclic semifields
- Title not available (Why is that?)
- Pseudometric spaces: from minimality to maximality in the groups of combinatorial self-similarities
- Ultrametric preserving functions and weak similarities of ultrametric spaces
- Uniqueness of best proximity pairs and rigidity of semimetric spaces
- Title not available (Why is that?)
This page was built for publication: Semigroups generated by partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227539)