Universal Cycles for Weak Orders

DOI10.1137/120886807zbMath1292.05011arXiv1203.5169OpenAlexW2964340647MaRDI QIDQ2870511

Victoria Horan, Glenn H. Hurlbert

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.5169

zbMATH Keywords

weak ordersuniversal cyclesoverlap cyclespermutation with ties

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Related Items (7)

A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Universal and overlap cycles for posets, words, and juggling patterns ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Graph universal cycles of combinatorial objects ⋮ Efficient universal cycle constructions for weak orders ⋮ Shortened universal cycles for permutations

This page was built for publication: Universal Cycles for Weak Orders