The enumeration of permutations whose posets have a maximum element
From MaRDI portal
Publication:867908
DOI10.1016/J.AAM.2005.11.003zbMATH Open1176.05004OpenAlexW2032010550MaRDI QIDQ867908FDOQ867908
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
Recommendations
Catalan numbersfunctional equationsrestricted permutationsPadovan numbersposets having maximal element
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Permutations which are the union of an increasing and a decreasing subsequence
- The permutation classes equinumerous to the smooth class
- Generating functions for generating trees
- Title not available (Why is that?)
- 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.
- 321-polygon-avoiding permutations and Chebyshev polynomials
- Title not available (Why is that?)
- Avoiding maximal parabolic subgroups of \(S_k\)
Cited In (8)
- The maximal length of a \(k\)-separator permutation
- Maximal total absolute displacement of a permutation
- Title not available (Why is that?)
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- 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
Uses Software
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)