Permutations with Extremal number of Fixed Points
| dc.creator | Han, Guo-Niu | |
| dc.creator | Xin, Guoce | |
| dc.date | 2007-06-12 | |
| dc.date | 2007-06-22 | |
| dc.date.accessioned | 2026-07-07T08:11:29Z | |
| dc.date.available | 2026-07-07T08:11:29Z | |
| dc.description | 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. | |
| dc.description | minor change about corollary 3 | |
| dc.identifier | https://arxiv.org/abs/0706.1738 | |
| dc.identifier | http://arxiv.org/abs/0706.1738 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132136 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05; 05A15; 05E05 | |
| dc.title | Permutations with Extremal number of Fixed Points | |
| dc.type | text |