On trees and noncrossing partitions

DOI10.1016/S0166-218X(97)00118-2zbMath0904.05003MaRDI QIDQ1383385

Martin Klazar

Publication date: 11 January 1999

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

treesnoncrossing partitionsidentities for partitionsnormal noncrossing sequences

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Related Items

Regular simple queues of protein contact maps ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ Partitions and partial matchings avoiding neighbor patterns ⋮ RNA secondary structures with given motif specification: combinatorics and algorithms ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions ⋮ Enumeration of \((k,2)\)-noncrossing partitions ⋮ Reduction of \(m\)-regular noncrossing partitions ⋮ Partitions of a set satisfying certain set of conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chain enumeration and non-crossing partitions
• On the structure of the lattice of noncrossing partitions
• On some new sequences generalizing the Catalan and Motzkin numbers
• Combinatorial statistics on non-crossing partitions
• Linear trees and RNA secondary structure
• Combinatorial aspects of Davenport-Schinzel sequences
• On \(abab\)-free and \(abba\)-free set partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
• A general bijective algorithm for trees.
• Enumerating Davenport-Schinzel sequences
• Catalan numbers revisited