Efficient methods of constructing universal cycles for [formula omitted]-permutations.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 185874700 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Efficient methods of constructing universal cycles for [formula omitted]-permutations. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Chang%2C+Zuling%22">Chang, Zuling</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zuling_chang@zzu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Diao%2C+Lingyu%22">Diao, Lingyu</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> dlylotus@163.com</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Shujie%22">Wang, Shujie</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> shujie_wang@gs.zzu.edu.cn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Oct2025, Vol. 374, p120-134. 15p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Permutations%22">Permutations</searchLink><br /><searchLink fieldCode="DE" term="%22Signs+%26+symbols%22">Signs & symbols</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=185874700 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.dam.2025.05.020 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 15 StartPage: 120 Subjects: – SubjectFull: Permutations Type: general – SubjectFull: Signs & symbols Type: general Titles: – TitleFull: Efficient methods of constructing universal cycles for [formula omitted]-permutations. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Chang, Zuling – PersonEntity: Name: NameFull: Diao, Lingyu – PersonEntity: Name: NameFull: Wang, Shujie IsPartOfRelationships: – BibEntity: Dates: – D: 30 M: 10 Text: Oct2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 0166218X Numbering: – Type: volume Value: 374 Titles: – TitleFull: Discrete Applied Mathematics Type: main |
| ResultId | 1 |
