Statistics in Weak Ascent Sequences

Weak ascent sequences are a generalization of ascent sequences that appear in many combinatorial problems. In this paper, we give a method to find generating functions that count how often a given statistic τ appears in weak ascent sequences of length n, keeping track of the number of weak ascents, where τ is the number of levels, ascents, descents, and weak descents.