The enumeration of permutations whose posets have a maximum element

DOI10.1016/J.AAM.2005.11.003MaRDI QIDQ867908zbMATH OpenOpenAlexFDO

Authors 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

Catalan numbersfunctional equationsrestricted permutationsPadovan numbersposets having maximal element

Mathematics Subject Classification ID

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

Recommendations

• Partially ordered sets associated with permutations
• Pattern avoidance in poset permutations
• The estimate of the number of permutationally-ordered sets
• Posets of matrices and permutations with forbidden subsequences
• Permutations containing many patterns

Cites work

• scientific article; zbMATH DE number 2159652 (Why is no real title available?)
• scientific article; zbMATH DE number 1447312 (Why is no real title available?)
• 321-polygon-avoiding permutations and Chebyshev polynomials
• Avoiding maximal parabolic subgroups of \(S_k\)
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Freely braided elements in Coxeter groups.
• Freely braided elements in Coxeter groups. II.
• Generating functions for generating trees
• Permutations which are the union of an increasing and a decreasing subsequence
• The On-Line Encyclopedia of Integer Sequences
• The permutation classes equinumerous to the smooth class

Cited in

(8)

• The maximal length of a k-separator permutation
• Maximal total absolute displacement of a permutation
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• scientific article; zbMATH DE number 5230562 (Why is no real title available?)
• Maximale (m,n)-Punktkonfigurationen. (Maximal (m,n)-configurations)
• Reduced decompositions and permutation patterns
• Rhombic tilings and Bott-Samelson varieties
• MacMahon's theorem for a set of permutations with given descent indices and right-maximal records

Describes a project that uses

Uses Software

• OEIS

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

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