An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations

DOI10.1080/07468342.2021.1909979MaRDI QIDQ4956281zbMATH OpenOpenAlexFDO

Authors Melanie Tian, Enrique Treviño

Publication date 1 September 2021

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/07468342.2021.1909979

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics (educational aspects) (97K20)

Recommendations

• Permutations by number of fixed points and anti-excedances
• Permutations with extremal number of fixed points
• Fixed points and excedances in restricted permutations
• scientific article; zbMATH DE number 3827965
• Counting permutations by numbers of excedances, fixed points and cycles
• A formula for enumerating permutations with a fixed pinnacle set
• scientific article; zbMATH DE number 786166
• A solution to one of Knuth's permutation problems
• A note on a recursion for the number of derangements
• scientific article; zbMATH DE number 1383175

Cites work

• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• The largest and the smallest fixed points of permutations

Cited in

(2)

• The average is one
• Identities for permutations with fixed points

This page was built for publication: An Unusual Recursive Formula to Answer a Question Regarding Fixed Points in Permutations

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