期刊文献+

循环群的t-幂等自同态的个数

On the Numbers of t-Idempotent Endomorphisms of Cyclic Groups
下载PDF
导出
摘要 设G为群,φ:G→G为群自同态。如果φ^(t)=φ,t∈N^(*),t≥2,那么称φ为G的t-幂等自同态。从新的角度认识循环群,并用初等数论的方法解决循环群幂等自同态问题。证明了若G是无限循环群,则G上t-幂等自同态的个数为2或3;若G为m阶循环群,m≥2,则G的2-幂等和3-幂等自同态的个数都可用m的不同的素因子的个数表示出来。 Let G be a group,φ:G→G a group endomorphism.Ifφ^(t)=φ,t∈N^(*),t≥2,thenφis called a t-idempotent endomorphism of G.This paper studies cyclic groups from a new perspective and solves the problem of idempotent endomorphisms of cyclic groups by means of elementary number theory.If G is an infinite cyclic group,then the number of t-idempotent endomorphisms on G is showed to be 2 or 3,and if G is a cyclic group of order m,m≥2,then the numbers of 2-idempotent and 3-idempotent endomorphisms of G are expressed by the number of different prime factors of m.
作者 许金珍 陈正新 XU Jinzhen;CHEN Zhengxin(School of Mathematics and Statistics,Fujian Normal University,Fuzhou Fujian 350117,China)
出处 《莆田学院学报》 2022年第5期30-34,共5页 Journal of putian University
基金 国家自然科学基金资助项目(11871014)。
关键词 t-幂等自同态 循环群 个数 素因子 t-idempotent endomorphism cyclic group number prime factor
  • 相关文献

参考文献5

二级参考文献26

  • 1Ostafe A,Shparlinski I E.Pseudorandomness anddynamics of Fermat quotients. SIAM Journal on Discrete Mathematics . 2011
  • 2Chen Z X,Ostafe A,Winterhof A.Structure ofpseudorandom numbers derived from Fermat quotients. Proc of WAIFI 2010 . 2010
  • 3Shparlinski I.Character sums with Fermat quotients. The Quarterly Journal of MaThematics Oxford . 2011
  • 4Shparlinski I.Bounds of multiplicative character sumswith Fermat quotients of primes. Bull Aust MathSoc . 2011
  • 5Shparlinski I.On the value set of Fermat quotients. Proceedings of the American Mathematical Society . 2011
  • 6Shparlinski I.Fermat quotients:Exponential sums,valueset and primitive roots. Bulletin of the London Mathematical Society . 2011
  • 7Gomez D,Winterhof A.Multiplicative character sumsof Fermat quotients and pseudorandom sequences. Periodica Mathematica Hungarica . 2011
  • 8Aly H,Winterhof A.Boolean functions derived fromFermat quotients. Cryptogr Commun . 2011
  • 9Chen Z X,Hu L,Du X N.Linear complexity ofsome binary sequences derived from Fermatquotients. China Communications . 2011
  • 10Du X N,Klapper A,Chen Z X.Linear complexityof pseudorandom sequences generated by Fermatquotients and their generalizations. . 2011

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部