Bibliographic Details
| Title: |
Efficient methods of constructing universal cycles for [formula omitted]-permutations. |
| Authors: |
Chang, Zuling1 (AUTHOR) zuling_chang@zzu.edu.cn, Diao, Lingyu1 (AUTHOR) dlylotus@163.com, Wang, Shujie2 (AUTHOR) shujie_wang@gs.zzu.edu.cn |
| Source: |
Discrete Applied Mathematics. Oct2025, Vol. 374, p120-134. 15p. |
| Subjects: |
Permutations, Signs & symbols |
| Abstract: |
We present two efficient methods of constructing universal cycles for the set of all k -permutations of the n -set { 1 , 2 , ... , n } for n > k ≥ 3. These two methods generate universal cycles for k -permutations from pure cycling registers with feedback function f (x 0 , x 1 , ... , x k − 1) = x 0 , using the cycle joining method. Here we design two classes of successor rules that build upon a framework proposed by Gabric et al. (2020), each of which produces n − k shift inequivalent universal cycles for k -permutations. Each universal cycle for k -permutations can be generated in O (n) time per symbol using O (n) space. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
