Generating finite cyclic and dihedral groups using

Generating finite cyclic and dihedral groups using sequential insertion systems with interactions
作者:Wan Heng Fong; Sarmin, N.H.; Turaev, S.; Yosman, A.F.
AIP Conference Proceedings
卷: 1830   页: 070005 (6 pp.)  
DOI: 10.1063/1.4980954  
出版年: 27 April 2017  

会议名称
会议:4th International Conference on Mathematical Sciences: Mathematical Sciences: Championing the Way in a Problem-Based and Data-Driven Society
会议地点:Putrajaya, Malaysia
会议日期:15-17 Nov. 2016
摘要
The operation of insertion has been studied extensively throughout the years for its impact in many areas of theoretical computer science such as DNA computing. First introduced as a generalization of the concatenation operation, many variants of insertion have been introduced, each with their own computational properties. In this paper, we introduce a new variant that enables the generation of some special types of groups called sequential insertion systems with interactions. We show that these new systems are able to generate all finite cyclic and dihedral groups.
作者信息
作者地址: Wan Heng Fong; Sarmin, N.H.; Yosman, A.F.; Dept. of Math. Sci., Univ. Teknol. Malaysia, Johor Bahru, Malaysia.
Turaev, S.; Dept. of Comput. Sci., Int. Islamic Univ. Malaysia, Gombak, Malaysia.
出版商
AIP - American Institute of Physics, USA
类别 / 分类
研究方向:Mathematics; Business & Economics (由 Thomson Reuters 提供)
分类代码:A0220 Group theory; B0210 Algebra; C1110 Algebra; E0210A Algebra
CODEN:APCPCS

文献信息
文献类型:Conference Paper, Journal Paper
语种:English
入藏号:INSPEC:16837435
ISSN:0094-243X
参考文献数:15



文章来自: 本站原创
引用通告: 查看所有引用 | 我要引用此文章
Tags:
评论: 0 | 引用: 0 | 查看次数: 92 | 返回顶部
发表评论
昵 称: 
验证码: =3+8(答案错误内容将被重置)
内 容:
选 项:
为了保护您的发言权,请您文明用语,一旦有违规行为IP将被封查。
字数限制 1000 字 | UBB代码 开启 | [img]标签 开启