Permutations of a semigroup that map to inverses.
type: Item
instance of: scholarly article
title: Permutations of a semigroup that map to inverses.
zbMATH Open document ID: 1307.20057
author: Peter M. Higgins
published in: Semigroup Forum
publication date: 2014-11-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1901.05198
full work available at URL: Permutations by inverses final.pdf
review text: Let \(PT_X\) be the partial transformation semigroup on the set \(X\), \(V(u)\) the set of inverses of \(u\in PT_X\). For a semigroup \(S\) a permutation \(f\) on \(S\) is called permutation matching, if \(f\in PT_S\) and \(f(a)\in V(a)\) for every \(a\in\text{dom\,}f\). It is shown that the finite full transformation semigroup has a permutation matching.
reviewed by: Jaak Henno
Mathematics Subject Classification ID: 20M20
Mathematics Subject Classification ID: 20M17
zbMATH DE Number: 6363664
zbMATH Keywords: permutation matchings
zbMATH Keywords: Hall marriage lemma
zbMATH Keywords: transformation semigroups
zbMATH Keywords: finite regular semigroups
MaRDI profile type: Publication
OpenAlex ID: W1997788173
arXiv ID: 1901.05198
cites work: The monoid of orientation-preserving mappings on a chain
cites work: Coverings of Bipartite Graphs
cites work: The semigroup generated by the idempotents of a partition monoid.
cites work: On inverses of products of idempotents in regular semigroups
cites work: On finite 0-simple semigroups and graph theory
cites work: Q4003180
cites work: The product of the idempotents and an \(\mathcal H\)-class of the finite full transformation semigroup.
cites work: Generators and factorisations of transformation semigroups
cites work: COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
cites work: Set products in transformation semigroups
cites work: Completely O-simple semigroups and their associated graphs and groups
cites work: The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
cites work: Products of idempotents in certain semigroups of transformations
cites work: Q4126563
cites work: Idempotent generators in finite full transformation semigroups
cites work: Some subsemigroups of infinite full transformation semigroups
cites work: Q4846425
cites work: On relative ranks of full transformation semigroups
cites work: Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
cites work: Q5302760
cites work: Симметрическая полугруппа преоъраэований покрывается своими инверсными подполугруппами
DOI: 10.1007/S00233-013-9535-2
description: scientific article; zbMATH DE number 6363664