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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/57003/1/Generating%20some%20finite%20groups%20using%20sequential%20insertion%20systems-4BIGTC2017.pdf http://irep.iium.edu.my/57003/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|