Bibliographic Details
| Title: |
Efficient methods of constructing shorthand universal cycles for permutations. |
| Authors: |
Chang, Zuling1 (AUTHOR) zuling_chang@zzu.edu.cn, Diao, Lingyu1 (AUTHOR) dlylotus@163.com |
| Source: |
Discrete Applied Mathematics. Jun2026, Vol. 386, p217-227. 11p. |
| Subjects: |
Permutations, Time complexity, Computational complexity, Combinatorics |
| Abstract: |
A shorthand universal cycle for permutations is a cyclic string in which each shorthand permutation appears exactly once as a unique substring. In this paper, we present three simple and efficient methods of generating shorthand universal cycles for permutations, and these three methods generate a total of 2 + ∏ t = 2 n − 2 t ! shift inequivalent shorthand universal cycles for permutations. In addition, each of the three new methods can be used to generate a shorthand universal cycle for permutations in O (1) -amortized 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 |
