From Motzkin to Catalan permutations

DOI10.1016/S0012-365X(99)00254-XMaRDI QIDQ1978172zbMATH OpenFDO

Authors Elena Barcucci, A. Del Lungo, E. Pergola, R. Pinzani

Publication date 2 August 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)00254-X

zbMATH Keywords

Catalan numbersCatalan permutationsgenerating functionMotzkin numbersMotzkin permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• From Fibonacci to Catalan permutations
• Restricted permutations from Catalan to Fine and back
• Juxtaposing Catalan permutation classes with monotone ones
• A partition of Catalan permuted sequences with applications
• Affine Permutations and an Affine Catalan Monoid
• Catalan and Schröder permutations sortable by two restricted stacks
• Catalan intervals and uniquely sorted permutations
• scientific article; zbMATH DE number 4055619
• scientific article; zbMATH DE number 1275883
• Permutation statistics and the \(q,t\)-Catalan sequence

Cited in

(21)

• The permuted analogues of three Catalan sets
• A new occurrence of Catalan numbers: cap permutations
• Taylor expansions for Catalan and Motzkin numbers
• Subregularity in infinitely labeled generating trees of restricted permutations
• Catalan intervals and uniquely sorted permutations
• Finitely labeled generating trees and restricted permutations
• Dyck paths and restricted permutations
• In memoriam: Alberto Del Lungo (1965--2003)
• From Fibonacci to Catalan permutations
• scientific article; zbMATH DE number 4055619 (Why is no real title available?)
• Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
• Affine Permutations and an Affine Catalan Monoid
• Juxtaposing Catalan permutation classes with monotone ones
• Some permutations with forbidden subsequences and their inversion number
• Permutations restricted by two distinct patterns of length three
• Pattern avoiding partitions and Motzkin left factors
• Holonomic equations and efficient random generation of binary trees
• Cycles in the graph of overlapping permutations avoiding barred patterns
• Modular Catalan numbers
• Dyck paths with coloured ascents
• More restrictive Gray codes for some classes of pattern avoiding permutations

This page was built for publication: From Motzkin to Catalan permutations

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