Permutations of a semigroup that map to inverses.

DOI10.1007/S00233-013-9535-2zbMATH Open1307.20057arXiv1901.05198OpenAlexW1997788173MaRDI QIDQ467524FDOQ467524

Authors: Peter M. Higgins 

Publication date: 3 November 2014

Published in: Semigroup Forum (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1901.05198

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

zbMATH Keywords

transformation semigroupsfinite regular semigroupsHall marriage lemmapermutation matchings

Mathematics Subject Classification ID

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

Cites Work

• The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coverings of Bipartite Graphs
• The \(\mathfrak q\)-theory of finite semigroups.
• Products of idempotents in certain semigroups of transformations
• On inverses of products of idempotents in regular semigroups
• The semigroup generated by the idempotents of a partition monoid.
• Idempotent generators in finite full transformation semigroups
• On relative ranks of full transformation semigroups
• Completely O-simple semigroups and their associated graphs and groups
• On finite 0-simple semigroups and graph theory
• 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
• The monoid of orientation-preserving mappings on a chain
• Generators and factorisations of transformation semigroups
• The product of the idempotents and an \(\mathcal H\)-class of the finite full transformation semigroup.
• Set products in transformation semigroups
• Some subsemigroups of infinite full transformation semigroups
• Симметрическая полугруппа преоъраэований покрывается своими инверсными подполугруппами

Cited In (4)

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