Generating some finite groups using sequential insertion systems

The operation of insertion in theoretical computer science has spurred much interest among researchers across many disciplines, where initially, it was introduced to generalize the concatenation operation. Previously, it was shown that a new variant of insertion, called sequential insertion systems...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Yosman, Ahmad Firdaus, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
التنسيق: Conference or Workshop Item
اللغة:English
منشور في: 2017
الموضوعات:
الوصول للمادة أونلاين:http://irep.iium.edu.my/57003/1/Generating%20some%20finite%20groups%20using%20sequential%20insertion%20systems-4BIGTC2017.pdf
http://irep.iium.edu.my/57003/
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
المؤسسة: Universiti Islam Antarabangsa Malaysia
اللغة: English
الوصف
الملخص:The operation of insertion in theoretical computer science has spurred much interest among researchers across many disciplines, where initially, it was introduced to generalize the concatenation operation. Previously, it was shown that a new variant of insertion, called sequential insertion systems with interactions, could generate all finite cyclic and dihedral groups. In this paper, we show that sequential insertion systems with interactions are also able to generate the quaternion group and all symmetric groups. We also determine the relation between sequential insertion systems with interactions and bonded sequential insertion systems.