42
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Regularity on Near Permutation Semigroups

Pages 2803-2826 | Received 01 Jan 2003, Published online: 18 Aug 2006
 

Abstract

A transformation semigroup over a set X with N elements is said to be a near permutation semigroup if it is generated by a group of permutations on N elements and by a set of transformations of rank N − 1. The aim of this paper is to determine computationally efficient conditions to test whether or not a near permutation semigroup is regular.

Mathematics Subject Classification:

Acknowledgment

The author acknowledges the financial support of the Sub-Programa Cieˆncia e Tecnologia do 2o Quadro Comunitário de Apoio (grant number BD/18012/98) and project POCTI/32440/MAT/2000 (CAUL) of FCT and FEDER.

Notes

#Communicated by P. Higgins.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,187.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.