Permutations with extremal number of fixed points

DOI10.1016/j.jcta.2008.08.001zbMath1191.05003arXiv0706.1738OpenAlexW2121070347MaRDI QIDQ1003653

Guoce Xin, Guo-Niu Han

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0706.1738

zbMATH Keywords

derangementsalternating permutationsdescent setdesarrangements

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (6)

Fixed points and matching points in partitions ⋮ Schur-concavity for avoidance of increasing subsequences in block-ascending permutations ⋮ Plethystic formulas for permutation enumeration ⋮ Fix-Mahonian calculus. I: Two transformations ⋮ Fixed points of a random restricted growth sequence ⋮ Unnamed Item

Cites Work

• Permutation tableaux and permutation patterns
• Alternating permutations and symmetric functions
• Signed words and permutations. IV: Fixed and pixed points
• Fix-Mahonian calculus. III: a quadruple distribution
• Fix-Mahonian calculus. I: Two transformations
• A conjecture of Stanley on alternating permutations
• Eulerian numbers, Newcomb's problem and representations of symmetric groups
• Enumeration of permutations with prescribed up-down and inversion sequences
• Another interpretation of the number of derangements
• Counting permutations with given cycle structure and descent set
• Descent classes of permutations with a given number of fixed points
• Descents of derangements and circular words
• A Coloring Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permutations with extremal number of fixed points