A formula for the number of up-down words
Abstract
A word w1w2·s wn is said to be up-down if w1 < w2 >w3 ·s. Carlitz and Scoville found the generating function for the number of up-down words over an alphabet of size k. Using properties of the Chebyshev polynomials we derive a closed-form formula for these numbers.
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.