Permuting Operations on Strings: Their Permutations and Their Primes

Share/Save/Bookmark

Asveld, Peter R.J. (2009) Permuting Operations on Strings: Their Permutations and Their Primes. [Report]

open access
[img]
Preview
PDF
402kB
Abstract:We study some length-preserving operations on strings that permute the symbol positions in strings. These operations include some well-known examples (reversal, circular or cyclic shift, shuffle, twist, operations induced by the Josephus problem) and some new ones based on Archimedes spiral. Such a permuting operation $X$ gives rise to a family $\{p(X,n)\}_{n\geq2}$ of similar permutations. We investigate the structure and the order of the cyclic group generated by such a permutation $p(X,n)$. We call an integer $n$ $X$-prime if $p(X,n)$ consists of a single cycle of length $n$ ($n\geq2$). Then we show some properties of these $X$-primes, particularly, how $X$-primes are related to $X^\prime$-primes as well as to ordinary prime numbers.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/67513
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page