Efficient methods of constructing universal cycles for k-permutations

DOI10.1016/J.DAM.2025.05.020MaRDI QIDQ6965799zbMATH OpenFDO

Authors Zuling Chang, Lingyu Diao, Shujie Wang

Publication date 30 June 2025

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

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

zbMATH Keywords

cycle joining methodlexicographic orderpermutationsuccessor ruleuniversal cycle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• A new universal cycle for permutations
• A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
• An algorithm for constructing m-ary de Bruijn sequences
• An explicit universal cycle for the (n-1)-permutations of an n-set
• Constructing the first (and coolest) fixed-content universal cycle
• Counting with Nonlinear Binary Feedback Shift Registers
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Research problems on Gray codes and universal cycles
• Shift Register Sequences
• Shorthand universal cycles for permutations
• Universal cycles for combinatorial structures
• Universal cycles for permutations
• Universal Cycles for Weight-Range Binary Strings
• Universal cycles of k-subsets and k-permutations

Cited in

(1)

• Efficient universal cycle constructions for k-permutations via concatenation trees

This page was built for publication: Efficient methods of constructing universal cycles for \(k\)-permutations

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