Permutations with extremal number of fixed points
From MaRDI portal
Publication:1003653
DOI10.1016/J.JCTA.2008.08.001zbMATH Open1191.05003arXiv0706.1738OpenAlexW2121070347MaRDI QIDQ1003653FDOQ1003653
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting permutations with given cycle structure and descent set
- Transition of Grothendieck polynomials.
- A Coloring Problem
- Eulerian numbers, Newcomb's problem and representations of symmetric groups
- Enumeration of permutations with prescribed up-down and inversion sequences
- Alternating permutations and symmetric functions
- Permutation tableaux and permutation patterns
- A conjecture of Stanley on alternating permutations
- Descent classes of permutations with a given number of fixed points
- Fix-Mahonian calculus. III: a quadruple distribution
- Fix-Mahonian calculus. I: Two transformations
- Descents of derangements and circular words
- Signed words and permutations. IV: Fixed and pixed points
- Another interpretation of the number of derangements
Cited In (16)
- An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
- Permutations Fixing ak-set
- Title not available (Why is that?)
- Fix-Mahonian calculus. I: Two transformations
- Title not available (Why is that?)
- Good permutations for extreme discrepancy
- Maximal total absolute displacement of a permutation
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- Fixed points and matching points in partitions
- Plethystic formulas for permutation enumeration
- Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
- Fixed points of a random restricted growth sequence
- Title not available (Why is that?)
- The largest and the smallest fixed points of permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
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)