The largest and the smallest fixed points of permutations

DOI10.1016/J.EJC.2009.12.002MaRDI QIDQ976162zbMATH OpenOpenAlexFDO

Authors Emeric Deutsch, Sergi Elizalde

Publication date 17 June 2010

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

derangement numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We give a new interpretation of the derangement numbers d_n as the sum of the values of the largest fixed points of all non-derangements of length n-1. We also show that the analogous sum for the smallest fixed points equals the number of permutations of length n with at least two fixed points. We provide analytic and bijective proofs of both results, as well as a new recurrence for the derangement numbers.

Recommendations

• Permutations with extremal number of fixed points
• Permutations by number of fixed points and anti-excedances
• Fixed points and excedances in restricted permutations
• scientific article; zbMATH DE number 3827965
• On fixed points of permutations.
• Fixed points and cycle structure of random permutations
• Largest minimal inversion-complete and pair-complete sets of permutations
• The permutations with n non‐fixed points and the subsets with n elements of a set
• Counting permutations by numbers of excedances, fixed points and cycles
• The finite subsets and the permutations with finitely many non‐fixed points of a set

Cites work

• scientific article; zbMATH DE number 1774199 (Why is no real title available?)
• Derangements and Genocchi numbers
• Symmetric inclusion-exclusion
• \(k\)-fixed-points-permutations

Cited in

(13)

• The degree of symmetry of lattice paths
• The largest singletons of set partitions
• scientific article; zbMATH DE number 3827965 (Why is no real title available?)
• An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations
• A combinatorial approach to derangement matrix of type \(B\)
• Maximal total absolute displacement of a permutation
• Fixed points and matching points in partitions
• Descent classes of permutations with a given number of fixed points
• Fixed points in compositions and words
• Fixed points of a random restricted growth sequence
• A simple bijective proof of a familiar derangement recurrence
• On the combinatorics of derangements and related permutations
• \(k\)-fixed-points-permutations

This page was built for publication: The largest and the smallest fixed points of permutations

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