Efficient methods of constructing universal cycles for k-permutations

From MaRDI portal

Efficient methods of constructing universal cycles for \(k\)-permutations

Jump to:navigation, search

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)

zbMATH Keywords

permutation lexicographic order universal cycle successor rule cycle joining method

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Efficient_methods_of_constructing_universal_cycles_for_%5C(k%5C)-permutations&oldid=76143459"