On shortening universal words for multi-dimensional permutations

Abstract

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that u-words (in fact, even u-cycles, a stronger claim) for $d$-dimensional permutations exist. In this paper, we use the idea of incomparable elements to prove that u-words of length $(n!)^{d-1}+n-1-i(n-1)$, for $d\geq 2$ and $$0\leq i\leq \frac{2^{d-1}}{n-1}\left[(1+(n-1)!)^{d-1}-\left(1+\frac{(n-1)!}{2}\right)^{d-1}\right],$$ for $d$-dimensional permutations of length $n$ exist, which generalizes the respective result of Kitaev, Potapov and Vajnovszki for ``usual'' permutations ($d=2$).

Figures (5)

• Figure 1: Clustering the graph of overlapping 3-permutations
• Figure 2: Clustering the graph of overlapping 4-permutations
• Figure 3: Clustering the graph of overlapping 3-dimensional 3-permutations
• Figure 4: The clustered graph giving the maximum compression possibility using incomparable elements at distance 2 for 3-dimensional 3-permutations
• Figure 5: The clustered graph giving a non-maximum compression possibility using incomparable elements at distance 2 for 3-dimensional 3-permutations

Theorems & Definitions (10)

• Theorem 1.1
• Definition 2.1
• Theorem 2.2
• Lemma 3.1
• proof
• Lemma 3.2
• proof
• Lemma 3.3
• proof
• Definition 4.1