Minimal permutations with d descents
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5865333 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A variant of the tandem duplication-random loss model of genome rearrangement
- Analytic combinatorics
- Dyck path enumeration
- Generating functions for generating trees
- Kernel method and linear recurrence system
- On \(abab\)-free and \(abba\)-free set partitions
- On the tandem duplication-random loss model of genome rearrangement
- Polygon dissections and standard Young tableaux
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
Cited in
(12)- Posets and permutations in the duplication-loss model
- scientific article; zbMATH DE number 1538179 (Why is no real title available?)
- The minimum Manhattan distance and minimum jump of permutations
- Some properties of non minimal permutations
- Minimal permutations and 2-regular skew tableaux
- On the enumeration of \(d\)-minimal permutations
- scientific article; zbMATH DE number 6521429 (Why is no real title available?)
- André permutations, right-to-left and left-to-right minima
- Reconstructing permutations from identification minors
- Descents in \(t\)-sorted permutations
- Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
This page was built for publication: Minimal permutations with \(d\) descents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976167)