An (almost) optimal answer to a question by Wilf

Simple item page
dc.creatorColeman, Micah
dc.date2004-04-08
dc.date.accessioned2026-07-07T05:07:18Z
dc.date.available2026-07-07T05:07:18Z
dc.descriptionWe present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
dc.identifierhttps://arxiv.org/abs/math/0404181
dc.identifierhttp://arxiv.org/abs/math/0404181
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70805
dc.subjectCombinatorics
dc.titleAn (almost) optimal answer to a question by Wilf
dc.typetext

Files

Collections

arXiv