Generating Gray codes for weak orders in constant amortized time

DOI10.1016/j.disc.2020.111992zbMath1460.68071OpenAlexW3037432008MaRDI QIDQ785788

D. Kharzeev

Publication date: 12 August 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111992

zbMATH Keywords

Gray codeweak orderCAT algorithmshift Gray codeCayley permutationreflectable language

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loopless generation of linear extensions of a poset
• Greedy universal cycle constructions for weak orders
• Efficient universal cycle constructions for weak orders
• Cayley permutations
• Gray codes for reflectable languages
• Research problems on Gray codes and universal cycles
• An asymptotic equivalent for the number of total preorders on a finite set
• Gray code for Cayley permutations
• A loopless algorithm for generating the permutations of a multiset
• A loop-free algorithm for generating the linear extensions of a poset
• The number of weak orderings of a finite set
• Generating Multiset Permutations in Constant Time
• A Survey of Combinatorial Gray Codes
• Combinatorial generation via permutation languages
• On the Factorization of Squarefree Integers

This page was built for publication: Generating Gray codes for weak orders in constant amortized time