Algorithms for non-crossing partitions

zbMATH Open1114.05009MaRDI QIDQ3429586FDOQ3429586

Authors: William D. May, John C. Wierman 

Publication date: 2 April 2007

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

zbMATH Keywords

binary treesgroup actionspartially ordered sets

Mathematics Subject Classification ID

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

Cited In (5)

• Reduction of \(m\)-regular noncrossing partitions
• Horizontal partitions and Kleshchev's algorithm
• Title not available (Why is that?)
• Ballot-noncrossing partitions
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS

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)