On a family of universal cycles for multi-dimensional permutations

Tools

Kitaev, Sergey and Qiu, Dun (2024) On a family of universal cycles for multi-dimensional permutations. Discrete Applied Mathematics, 359. pp. 310-320. ISSN 0166-218X (https://doi.org/10.1016/j.dam.2024.08.010)

[thumbnail of Kitaev-Qiu-DAM-2024-On-a-family-of-universal-cycles-for-multi-dimensional-permutations]
Preview
 Text. Filename: Kitaev-Qiu-DAM-2024-On-a-family-of-universal-cycles-for-multi-dimensional-permutations.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (455kB)| Preview

Abstract

A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, 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-cycles for permutations exist, and they have been considered in the literature in several papers from different points of view. In this paper, we show how to construct a family of u-cycles for multi-dimensional permutations, which is based on applying an appropriate greedy algorithm. Our construction is a generalisation of the greedy way by Gao et al.¥ to construct u-cycles for permutations. We also note the existence of u-cycles for $d$-dimensional matrices.

ORCID iDs

Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647 and Qiu, Dun;
CORE (COnnecting REpositories)