Valleyless Sequences

Simple item page
dc.creatorRieper, Robert G.
dc.creatorZeleke, Melkamu
dc.date2000-05-17
dc.date.accessioned2026-07-07T04:35:21Z
dc.date.available2026-07-07T04:35:21Z
dc.descriptionValleyless sequences of finite length $n$ and maximum entry $k$ occur in tree enumeration problems and provide an interesting correspondence between permutations and compositions. In this paper we introduce the notion of \emph {valleyless} sequences, explore the correspondence and enumerate them using the method of generating functions.
dc.identifierhttps://arxiv.org/abs/math/0005180
dc.identifierhttp://arxiv.org/abs/math/0005180
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59225
dc.subjectCombinatorics
dc.titleValleyless Sequences
dc.typetext

Files

Collections

arXiv