Minimal permutations with \(d\) descents

DOI10.1016/j.ejc.2010.01.001zbMath1227.05022OpenAlexW2052838603MaRDI QIDQ976167

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

zbMATH Keywords

genome rearrangementtandem duplicationminimal permutationsrandom loss modelrecurrence relation on the multivariate generating function

Mathematics Subject Classification ID

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

Related Items (1)

Minimal permutations and 2-regular skew tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
• A variant of the tandem duplication-random loss model of genome rearrangement
• Dyck path enumeration
• Generating functions for generating trees
• On \(abab\)-free and \(abba\)-free set partitions
• Polygon dissections and standard Young tableaux
• Kernel method and linear recurrence system
• On the tandem duplication-random loss model of genome rearrangement

This page was built for publication: Minimal permutations with \(d\) descents