A partial order for the set of meanders

DOI10.1007/BF01626026zbMath0917.05009MaRDI QIDQ1272359

Reinhard O. W. Franz

Publication date: 19 July 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

partial ordernon-crossing partitionsmeanders

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Algebraic aspects of posets (06A11)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Plane and projective meanders
• A combinatorial matrix in 3-manifold theory
• Ordered trees and non-crossing partitions
• On the structure of the lattice of noncrossing partitions
• Parking functions and noncrossing partitions
• Meanders: A direct enumeration approach
• Principles of combinatorics
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• A branched covering of \(CP^ 2\to S^ 4\), hyperbolicity and projectivity topology
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Sorting jordan sequences in linear time using level-linked search trees

This page was built for publication: A partial order for the set of meanders