A new generation tree for permutations, preserving the number of fixed points

MaRDI QIDQ4584141zbMATH OpenFDO

Authors Philippe Duchon, Romaric Duvignau

Publication date 29 August 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAT0159

zbMATH Keywords

permutationsfixed pointsderangementsrandom generationgeneration tree

Mathematics Subject Classification ID

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

Recommendations

• Preserving the number of cycles of length k in a growing uniform permutation
• Efficient generation of random derangements with the expected distribution of cycle lengths
• Constant time generation of derangements
• Generating random derangements
• Random and exhaustive generation of permutations and cycles

Cited in

(7)

• Efficient generation of random derangements with the expected distribution of cycle lengths
• Uniformly generating derangements with fixed number of cycles in polynomial time
• Preserving the number of cycles of length k in a growing uniform permutation
• Constant time generation of derangements
• Generating random derangements
• Local limit of the fixed point forest
• scientific article; zbMATH DE number 4187815 (Why is no real title available?)

This page was built for publication: A new generation tree for permutations, preserving the number of fixed points

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