A new generation tree for permutations, preserving the number of fixed points
We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points. Our tree is optimal for the number of permutations having this property. We then use this tree to d...
Main Authors: | Philippe Duchon, Romaric Duvignau |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2014-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2433/pdf |
Similar Items
-
Combinatorial properties of permutation tableaux
by: Alexander Burstein, et al.
Published: (2008-01-01) -
On the Minimum Number of Completely 3-Scrambling Permutations
by: Jun Tarui
Published: (2005-01-01) -
Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01) -
Affine permutations and rational slope parking functions
by: Eugene Gorsky, et al.
Published: (2014-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01)