The enumeration of permutations whose posets have a maximum element

DOI10.1016/j.aam.2005.11.003zbMath1176.05004OpenAlexW2032010550MaRDI QIDQ867908

Toufik Mansour

Publication date: 19 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.aam.2005.11.003

zbMATH Keywords

functional equationsCatalan numbersrestricted permutationsPadovan numbersposets having maximal element

Mathematics Subject Classification ID

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

Related Items (2)

Rhombic tilings and Bott–Samelson varieties ⋮ Reduced decompositions and permutation patterns

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating functions for generating trees
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations which are the union of an increasing and a decreasing subsequence
• The permutation classes equinumerous to the smooth class
• Freely braided elements in Coxeter groups.
• 321-polygon-avoiding permutations and Chebyshev polynomials
• Freely braided elements in Coxeter groups. II.

This page was built for publication: The enumeration of permutations whose posets have a maximum element