首页 | 本学科首页   官方微博 | 高级检索  
     


The minimal number of generators of a finite semigroup
Authors:Robert D. Gray
Affiliation:1. School of Mathematics, University of East Anglia, Norwich, UK
Abstract:The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (not necessarily regular) Rees matrix semigroup over a group. The formula is expressed in terms of the dimensions of the structure matrix, and the relative rank of a certain subset of the structure group obtained from subgroups generated by entries in the structure matrix, which is assumed to be in Graham normal form. This formula is then applied to answer questions about minimal generating sets of certain natural families of transformation semigroups. In particular, the problem of determining the maximum rank of a subsemigroup of the full transformation monoid (and of the symmetric inverse semigroup) is considered.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号