Cool-lex order and \(k\)-ary Catalan structures

DOI10.1016/j.jda.2012.04.015zbMath1257.68120MaRDI QIDQ1932373

Debajyoti Mondal, Stephane Durocher, Aaron Williams, Frank Ruskey, (Ben) P. C. Li

Publication date: 18 January 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.015

zbMATH Keywords

ranking; \(k\)-ary trees; cool-lex order; \(k\)-ary Dyck words; Catalan structures; bubble languages; loopless algorithms

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

68W05: Nonnumerical algorithms

68R15: Combinatorics on words

68P05: Data structures

Related Items

The coolest way to generate binary strings, Successor rules for flipping pancakes and burnt pancakes, A shift Gray code for fixed-content Łukasiewicz words, Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, Flip-swap languages in binary reflected Gray code order

Cites Work

• Unnamed Item
• Unnamed Item
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Binary bubble languages and cool-lex order
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• The coolest way to generate combinations
• Generating t-ary trees in A-order
• Catalan numbers, their generalization, and their uses
• Ranking and unranking permutations in linear time
• On generating \(k\)-ary trees in computer representation
• A loop-free algorithm for generating the linear extensions of a poset
• Ranking and unranking algorithms for loopless generation of t-ary trees
• Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
• Linear-Time Ranking of Permutations
• Generating the Linear Extensions of Certain Posets by Transpositions
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically
• Generation oft-ary trees with Ballot-sequences^*
• Parallel Processing and Applied Mathematics
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Computing and Combinatorics
• Generation of Permutations by Adjacent Transposition