On trees and noncrossing partitions

DOI10.1016/S0166-218X(97)00118-2zbMATH Open0904.05003MaRDI QIDQ1383385FDOQ1383385

Authors: 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

Recommendations

• Ordered trees and non-crossing partitions
• On tree partitions
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• On tree-partitions of graphs
• On the partition dimension of trees
• Partitions and labeled trees
• Partition complexes and trees
• Aronszajn trees and partitions
• Partitionability of trees
• Partitions and normal trees

zbMATH Keywords

treesnoncrossing partitionsidentities for partitionsnormal noncrossing sequences

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (36)

• A bijection between nonnegative words and sparse \(abba\)-free partitions
• Partitions and partial matchings avoiding neighbor patterns
• Club-guessing and non-structure of trees
• Partitions, Kostka polynomials and pairs of trees
• Set partitions avoid a four-letter pattern
• Enumeration of connected Catalan objects by type
• Graham's tree reconstruction conjecture and a Waring-type problem on partitions
• On tree partitions
• Enumeration of \((k,2)\)-noncrossing partitions
• Combinatorial statistics on non-crossing partitions
• Counting complements in the partition lattice, and hypertrees
• Regular simple queues of protein contact maps
• Reduction of \(m\)-regular noncrossing partitions
• Sets, Lists and Noncrossing Partitions
• Title not available (Why is that?)
• A bijective proof of an identity for noncrossing graphs
• A bijection between certain non-crossing partitions and sequences
• Simply generated non-crossing partitions
• m-Noncrossing trees
• Title not available (Why is that?)
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
• Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.
• On partitions avoiding 3-crossings
• Algorithms for non-crossing partitions
• Partitions of a set satisfying certain set of conditions
• Combinatorics of non-ambiguous trees
• Bijections between bicoloured ordered trees and non-crossing partitions.
• Some set partition statistics in non-crossing partitions and generating functions
• Title not available (Why is that?)
• Aronszajn trees and partitions
• Crossed partitions
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
• RNA secondary structures with given motif specification: combinatorics and algorithms
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• Identities for non-crossing graphs and multigraphs
• A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions

This page was built for publication: On trees and noncrossing partitions

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