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


Counting f such that f o g = g o f
Authors:P. Bouchard  Y. Fong  W. F. Ke  Y. N. Yeh
Affiliation:1. Département de math. et d’informatique, Université du Québec à Montrél, C.P. 8888, Succursale A, Montrél, Québec, Canada, H3C 3P8
2. Department of Mathematics, National Cheng Kung University, Tainan, Taiwan 701, ROC
3. Institute of Mathematics, Academia Sinica Nankang, Taipei, Taiwan, 11529, ROC
Abstract:In this paper, we derive an algorithm for finding all the mappings f of a finite set A which commute with a fixed mapping g: A → A. This algorithm is then applied to finding all the infra-endomorphisms of the groups ?n and Dn.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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