Permutations with extremal number of fixed points

From MaRDI portal
Publication:1003653

DOI10.1016/J.JCTA.2008.08.001zbMATH Open1191.05003arXiv0706.1738OpenAlexW2121070347MaRDI QIDQ1003653FDOQ1003653

Guoce Xin, Guo-Niu Han

Publication date: 4 March 2009

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

Abstract: We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Desarmenien's desarrangement combinatorics, Gessel's hook-factorization and the analytical properties of two new permutation statistics "DEZ" and "lec". Explicit formulas for the maximal case are derived by using symmetric function tools.


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





Cites Work


Cited In (16)






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

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