Valleyless Sequences
Combinatorics
2007-05-23 v1
Abstract
Valleyless sequences of finite length and maximum entry 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.
Keywords
Cite
@article{arxiv.math/0005180,
title = {Valleyless Sequences},
author = {Robert G. Rieper and Melkamu Zeleke},
journal= {arXiv preprint arXiv:math/0005180},
year = {2007}
}