Preserving the number of cycles of length k in a growing uniform permutation

zbMATH Open1351.05126MaRDI QIDQ727199FDOQ727199

Authors: Philippe Duchon, Romaric Duvignau 

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p22

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A new generation tree for permutations, preserving the number of fixed points
• Random and exhaustive generation of permutations and cycles
• On the distribution of the number of cycles of a given length in the class of permutations with known number of cycles
• Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
• Probability generating functions for Sattolo's algorithm

zbMATH Keywords

random generationrandom permutations\(k\)-cycles in permutationsgeneration tree

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Distance in graphs (05C12) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Eigenvalues of Random Matrices
• Title not available (Why is that?)
• The cycle structure of random permutations
• \(k\)-fixed-points-permutations
• Another interpretation of the number of derangements
• Generating random derangements
• Local update algorithms for random graphs

Cited In (1)

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

This page was built for publication: Preserving the number of cycles of length \(k\) in a growing uniform permutation

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