Permutations of a semigroup that map to inverses.

DOI10.1007/S00233-013-9535-2MaRDI QIDQ467524zbMATH OpenOpenAlexFDO

Authors Peter M. Higgins

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, http://repository.essex.ac.uk/11534/1/Permutations%20by%20inverses%20final.pdf

zbMATH Keywords

finite regular semigroupsHall marriage lemmapermutation matchingstransformation semigroups

Mathematics Subject Classification ID

Regular semigroups (20M17) Semigroups of transformations, relations, partitions, etc. (20M20)

Abstract: We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms of a related graph and, using an application of Hall's Marriage Lemma, we show in particular that the finite full transformation semigroup does enjoy this property.

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.

Recommendations

• Involution matchings, the semigroup of orientation-preserving and orientation-reversing mappings, and inverse covers of the full transformation semigroup
• Orthodox semigroups and permutation matchings
• Inverse near permutation semigroups.
• scientific article; zbMATH DE number 1985547
• Publication:4869408

Cites work

• Completely O-simple semigroups and their associated graphs and groups
• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
• Coverings of Bipartite Graphs
• Generators and factorisations of transformation semigroups
• scientific article; zbMATH DE number 52907 (Why is no real title available?)
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• Idempotent generators in finite full transformation semigroups
• On finite 0-simple semigroups and graph theory
• On inverses of products of idempotents in regular semigroups
• On relative ranks of full transformation semigroups
• Products of idempotents in certain semigroups of transformations
• Set products in transformation semigroups
• Some subsemigroups of infinite full transformation semigroups
• The \(\mathfrak q\)-theory of finite semigroups.
• The monoid of orientation-preserving mappings on a chain
• The product of the idempotents and an H-class of the finite full transformation semigroup.
• The semigroup generated by the idempotents of a partition monoid.
• The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
• Симметрическая полугруппа преоъраэований покрывается своими инверсными подполугруппами

Cited in

(4)

• Orthodox semigroups and permutation matchings
• Involution matchings, the semigroup of orientation-preserving and orientation-reversing mappings, and inverse covers of the full transformation semigroup
• Finite regular semigroups with permutations that map elements to inverses
• On groups generated by involutions of a semigroup.

This page was built for publication: Permutations of a semigroup that map to inverses.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467524)