Enumerations of Universal Cycles for $k$-Permutations
Combinatorics
2021-11-30 v1
Abstract
Universal cycle for -permutations is a cyclic arrangement in which each -permutation appears exactly once as consecutive elements. Enumeration problem of universal cycles for -permutations is discussed and one new enumerating method is proposed in this paper. Accurate enumerating formulae are provided when .
Cite
@article{arxiv.2111.13814,
title = {Enumerations of Universal Cycles for $k$-Permutations},
author = {Zuling Chang and Jie Xue},
journal= {arXiv preprint arXiv:2111.13814},
year = {2021}
}