A Note on Multiset Permutations

DOI10.1137/S0895480192231881zbMATH Open0808.05009OpenAlexW2048136051MaRDI QIDQ4287948FDOQ4287948

Lily Yen

Publication date: 9 March 1995

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480192231881

zbMATH Keywords

permutationsrecurrencemultiset

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Combinatorial identities, bijective combinatorics (05A19)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for calculation of the number of \(m\)-permutations of multisets
• Title not available (Why is that?)
• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note on λ-Permutations
• Stirling permutations on multisets
• A combinatorial interpretation of punctured partitions

   Recommendations

• The \(r\)-multipermutations 👍 👎
• An algorithm for calculation of the number of \(m\)-permutations of multisets 👍 👎
• Title not available (Why is that?) 👍 👎
• Adjacent-cycle permutations of a multiset 👍 👎

This page was built for publication: A Note on Multiset Permutations

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