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

zbMATH Open1393.05012MaRDI QIDQ4584141FDOQ4584141

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

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

zbMATH Keywords

permutationsfixed pointsderangementsrandom generationgeneration tree

Mathematics Subject Classification ID

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

Cited In (7)

• 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
• Title not available (Why is that?)
• Efficient generation of random derangements with the expected distribution of cycle lengths

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)