Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions

DOI10.1016/j.tcs.2015.05.021zbMath1322.05022OpenAlexW2166899614MaRDI QIDQ500971

Alessandro Conflitti, Ricardo Mamede

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.021

zbMATH Keywords

nonnesting partitionsgray codeslexicographical combinatorial generation

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial codes (94B25)

Related Items (3)

Gray codes for noncrossing and nonnesting partitions of classical types ⋮ Horizontal visibility graph of a random restricted growth sequence ⋮ Fixed points of a random restricted growth sequence

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generating tree approach to \(k\)-nonnesting partitions and permutations
• Generating alternating permutations lexicographically
• Bijections between noncrossing and nonnesting partitions for classical reflection groups
• Loop-free Gray code algorithms for the set of compositions
• On noncrossing and nonnesting partitions of type \(D\)
• Gray code for permutations with a fixed number of cycles
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Generating restricted classes of involutions, Bell and Stirling permutations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• Gray codes for non-crossing partitions and dissections of a convex polygon
• Gray codes, loopless algorithm and partitions
• Lexicographic generation of ordered trees
• A Gray code for set partitions
• On noncrossing and nonnesting partitions for classical reflection groups
• Non-crossing partitions for classical reflection groups
• Free probability theory and non-crossing partitions
• Generating words lexicographically: An average-case analysis
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Reduction of \(m\)-regular noncrossing partitions
• Counting set systems by weight
• Gray codes for reflection groups
• Gray code for derangements
• A bijection between nonnegative words and sparse \(abba\)-free partitions
• Exhaustive generation of combinatorial objects by ECO
• Bell numbers and \(k\)-trees
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• Noncrossing partitions
• On the lexicographical generation of compressed codes
• New interpretations for noncrossing partitions of classical types
• Lectures on the Combinatorics of Free Probability
• Noncrossing Partitions in Surprising Locations
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Combinatorial theory of the free product with amalgamation and operator-valued free probability theory
• A Gray code for compositions
• Generating Trees and Other Combinatorial Objects Lexicographically
• A Survey of Combinatorial Gray Codes
• ECO:a methodology for the enumeration of combinatorial objects
• A bijection between noncrossing and nonnesting partitions of types A and B
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions