Valleyless Sequences
Abstract
Valleyless 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 valleyless sequences, explore the correspondence and enumerate them using the method of generating functions.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.