Algorithms for non-crossing partitions

MaRDI QIDQ3429586zbMATH OpenFDO

Authors William D. May, John C. Wierman

Publication date 2 April 2007

zbMATH Keywords

binary treesgroup actionspartially ordered sets

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics in computer science (68R05)

Recommendations

• The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
• Noncrossing partitions
• On trees and noncrossing partitions
• On the structure of the lattice of noncrossing partitions
• Chains in the lattice of noncrossing partitions

Cited in

(5)

• Reduction of \(m\)-regular noncrossing partitions
• Ballot-noncrossing partitions
• Horizontal partitions and Kleshchev's algorithm
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• scientific article; zbMATH DE number 5492159 (Why is no real title available?)

This page was built for publication: Algorithms for non-crossing partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429586)