View in EDS

Efficient methods of constructing shorthand universal cycles for permutations.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 192967409
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Efficient methods of constructing shorthand universal cycles for 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>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Jun2026, Vol. 386, p217-227. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Permutations%22">Permutations</searchLink><br /><searchLink fieldCode="DE" term="%22Time+complexity%22">Time complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– 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=192967409
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.dam.2026.02.017
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 217
    Subjects:
      – SubjectFull: Permutations
        Type: general
      – SubjectFull: Time complexity
        Type: general
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Combinatorics
        Type: general
    Titles:
      – TitleFull: Efficient methods of constructing shorthand universal cycles for permutations.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chang, Zuling
      – PersonEntity:
          Name:
            NameFull: Diao, Lingyu
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 386
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1