Permutations of a semigroup that map to inverses.
From MaRDI portal
Publication:467524
DOI10.1007/s00233-013-9535-2zbMath1307.20057arXiv1901.05198OpenAlexW1997788173MaRDI QIDQ467524
Publication date: 3 November 2014
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.05198
Related Items (3)
Orthodox semigroups and permutation matchings ⋮ Involution matchings, the semigroup of orientation-preserving and orientation-reversing mappings, and inverse covers of the full transformation semigroup ⋮ On groups generated by involutions of a semigroup.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The product of the idempotents and an \(\mathcal H\)-class of the finite full transformation semigroup.
- Completely O-simple semigroups and their associated graphs and groups
- The monoid of orientation-preserving mappings on a chain
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
- The semigroup generated by the idempotents of a partition monoid.
- Coverings of Bipartite Graphs
- Some subsemigroups of infinite full transformation semigroups
- Idempotent generators in finite full transformation semigroups
- Generators and factorisations of transformation semigroups
- On relative ranks of full transformation semigroups
- COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
- Set products in transformation semigroups
- The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
- On finite 0-simple semigroups and graph theory
- Симметрическая полугруппа преоъраэований покрывается своими инверсными подполугруппами
- Products of idempotents in certain semigroups of transformations
- On inverses of products of idempotents in regular semigroups
This page was built for publication: Permutations of a semigroup that map to inverses.
