An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) (Q1953498): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5592272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal cycles for combinatorial structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On universal cycles for multisets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations / rank | |||
Normal rank |
Latest revision as of 12:39, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) |
scientific article |
Statements
An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) (English)
0 references
7 June 2013
0 references
Summary: In this paper, we introduce a method of constructing universal cycles on sets by taking ``sums'' and ``products'' of smaller cycles. We demonstrate this new approach by proving that if there exist universal cycles on the 4-subsets of [18] and the 4-subsets of [26], then for any integer \(n \geq 18\), \(n \equiv 2 \pmod{8}\), there exists a universal cycle on the 4-subsets of \([n]\).
0 references
universal cycles
0 references
ucycles
0 references
sums of cycles
0 references
products of cycles
0 references