Minimal permutations with d descents
DOI10.1016/J.EJC.2010.01.001zbMATH Open1227.05022OpenAlexW2052838603MaRDI QIDQ976167FDOQ976167
Authors: Sherry H. F. Yan, Toufik Mansour 
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.01.001
Recommendations
tandem duplicationgenome rearrangementminimal permutationsrandom loss modelrecurrence relation on the multivariate generating function
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- Analytic combinatorics
- On \(abab\)-free and \(abba\)-free set partitions
- Generating functions for generating trees
- Dyck path enumeration
- Polygon dissections and standard Young tableaux
- A variant of the tandem duplication-random loss model of genome rearrangement
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
- On the tandem duplication-random loss model of genome rearrangement
- Kernel method and linear recurrence system
- Title not available (Why is that?)
Cited In (9)
- Posets and permutations in the duplication-loss model
- Title not available (Why is that?)
- The minimum Manhattan distance and minimum jump of permutations
- Some properties of non minimal permutations
- Minimal permutations and 2-regular skew tableaux
- Title not available (Why is that?)
- Reconstructing permutations from identification minors
- Descents in \(t\)-sorted permutations
- 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)
