Odd-even staggering for permutations with fixed points
Journal of Combinatorial Mathematics and Combinatorial Computing · 17.06.2026 · 131 · 3-13
DOI: 10.61091/jcmcc131-01 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 17.06.2026. Verfasst von Jean-Christophe Pain.
Abstract (Originalsprache)
We study the difference between the numbers of even and odd permutations in \(\mathfrak{S}_n\) having exactly \(k\) fixed points. We derive a closed formula for this quantity using four complementary approaches: exponential generating functions, a determinant representation, a combinatorial derivation based on inclusion--exclusion on cycle structures, and a factorization via the stabilizer subgroup, through restriction to the complement of the fixed-point set. The resulting expression provides a signed refinement of the classical rencontres numbers and yields a simple polynomial form for the associated signed fixed-point distribution.
Zitieren
APA
Pain, J. (2026). Odd-even staggering for permutations with fixed points. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 3-13. https://doi.org/10.61091/jcmcc131-01
Vancouver
Pain J. Odd-even staggering for permutations with fixed points. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:3-13. doi:10.61091/jcmcc131-01
BibTeX
@article{Pain2026,
author = {Pain, Jean-Christophe},
title = {Odd-even staggering for permutations with fixed points},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {3--13},
doi = {10.61091/jcmcc131-01}
}
EUVIMED