A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations

DOI10.1007/s11083-005-9021-xzbMath1096.06007MaRDI QIDQ2494390

Elena Barcucci, Luca Ferrari, Antonio Bernini, Maddalena Poneti

Publication date: 26 June 2006

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-005-9021-x

zbMATH Keywords

distributive lattice; Bell numbers; Dyck paths; Catalan numbers; noncrossing partitions; 312-avoiding permutations; strong Bruhat order

Mathematics Subject Classification ID

05A18: Partitions of sets

06A07: Combinatorics of partially ordered sets

06D05: Structure and representation theory of distributive lattices

Related Items

Cellular resolutions of ideals defined by nondegenerate simplicial homomorphisms, The weak order on pattern-avoiding permutations, Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations, The phagocyte lattice of Dyck words, Noncrossing partitions and Bruhat order, Permutations and pairs of Dyck paths, Motzkin subposets and Motzkin geodesics in Tamari lattices., The pruning-grafting lattice of binary trees, A Heyting algebra on Dyck paths of type \(A\) and \(B\)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak order on pattern-avoiding permutations
• Bijections for refined restricted permutations
• Dyck path enumeration
• Two combinatorial statistics on Dyck paths
• Generating functions for generating trees
• On the diagram of 132-avoiding permutations
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• The matrix of chromatic joins and the Temperley-Lieb algebra.
• Generalized permutation patterns and a classification of the Mahonian statistics
• Vexillary involutions are enumerated by Motzkin numbers
• A linear operator approach to succession rules
• Generating trees and the Catalan and Schröder numbers
• Noncrossing partitions
• Bruhat lattices, plane partition generating functions, and minuscule representations
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Lattices of lattice paths
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• Shellable nonpure complexes and posets. II
• ECO:a methodology for the enumeration of combinatorial objects
• Generalized pattern avoidance
• An area-to-inv bijection between Dyck paths and 312-avoiding permutations
• Permutations with restricted patterns and Dyck paths