Efficient methods of constructing shorthand universal cycles for permutations

DOI10.1016/J.DAM.2026.02.017MaRDI QIDQ7230338zbMATH OpenFDO

Authors Zuling Chang, Lingyu Diao

Publication date 17 April 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.017

zbMATH Keywords

adjacency graphcycle joining methodshorthand permutationsuccessor ruleuniversal cycle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cites work

• A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
• Algebraic Shift Register Sequences
• An algorithm for constructing m-ary de Bruijn sequences
• An explicit universal cycle for the (n-1)-permutations of an n-set
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Counting with Nonlinear Binary Feedback Shift Registers
• De Bruijn sequences, irreducible codes and cyclotomy
• Faster generation of shorthand universal cycles for permutations
• scientific article; zbMATH DE number 1390152 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• On the classification of deBruijn sequences
• Research problems on Gray codes and universal cycles
• Shift Register Sequences
• Shorthand universal cycles for permutations
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Universal cycles for combinatorial structures
• Universal cycles for permutations
• Universal Cycles for Weight-Range Binary Strings
• Universal cycles of k-subsets and k-permutations

This page was built for publication: Efficient methods of constructing shorthand universal cycles for permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230338)