Equivalence class universal cycles for permutations (Q1910573): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal cycles for combinatorial structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4722111 / rank | |||
Normal rank |
Latest revision as of 11:15, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equivalence class universal cycles for permutations |
scientific article |
Statements
Equivalence class universal cycles for permutations (English)
0 references
25 March 1996
0 references
The paper sets out to construct a complete family of universal cycles of \(n\)-permutations using \(n+ 1\) symbols, and an equivalence relation based on differences. The notion of universal cycles as cyclic representations of combinatorial objects, a generalization of de Bruijn cycles, is of recent (1990's) interest---and the universal cycles for permutations examined in this paper is an example of this. Having set up the equivalence classes, the authors then construct a directed graph---which proves to be Eulerian. An Eulerian cycle provides the desired universal cycle for their example.
0 references
universal cycles
0 references
de Bruijn cycles
0 references
permutations
0 references
Eulerian cycle
0 references