On shortening u-cycles and u-words for permutations
Combinatorics
2018-11-01 v2
Abstract
This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for -permutations exist of lengths for .
Cite
@article{arxiv.1707.06110,
title = {On shortening u-cycles and u-words for permutations},
author = {Sergey Kitaev and Vladimir N. Potapov and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:1707.06110},
year = {2018}
}