Enumerations of universal cycles for \(k\)-permutations
From MaRDI portal
Publication:2144520
DOI10.1016/j.disc.2022.112975zbMath1491.05004arXiv2111.13814OpenAlexW3216729501MaRDI QIDQ2144520
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13814
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)
Cites Work
- Universal cycles of \(k\)-subsets and \(k\)-permutations
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Universal cycles for permutations
- Research problems on Gray codes and universal cycles
- Universal cycles for combinatorial structures
- A new universal cycle for permutations
- Shorthand universal cycles for permutations
- Algebraic Combinatorics
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
- Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumerations of universal cycles for \(k\)-permutations