Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

How Few n-Permutations Contain All Possible k-Permutations?

From MaRDI portal
Publication:3666855
Jump to:navigation, search

DOI10.2307/2975724zbMATH Open0518.05005OpenAlexW4240607548MaRDI QIDQ3666855FDOQ3666855

Peter Slater

Publication date: 1983

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2975724



zbMATH Keywords

permutationsproblems


Mathematics Subject Classification ID

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








This page was built for publication: How Few n-Permutations Contain All Possible k-Permutations?

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3666855&oldid=17127261"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 06:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki