Paperlane

no. 17 · Wednesday 18 November 2026

Counting formulas and refined generating functions for inversion-sequence Classes 152 and 207

Haobo Ma, Toufik Mansour and Wenlin Zhang

math.CO · 25 pp

Abstract

For the two Class 152 pattern sets, we prove that the common number of inversion sequences of length \(n\geq 1\) is \(a_n=1+\sum_{j=1}^{n-1}\binom{2j}{j}\). The Class 152 proof uses first-descent and last-zero decompositions, with weighted Dyck paths evaluating the resulting generating functions. For Class 207, we prove equality of the three total-count series and give their common generating function as an explicit Lambert-series expression after the substitution \(z=q/(1+q)^2\). Complete legal-site and catalytic recurrences lead to a Lambert series for one class and \(q\)-product orbit sums for another. A cubic limit of the balanced nonterminating \({}_3φ_2\) \(q\)-Saalschutz summation identifies these expressions. Fixed-maximum expansions, finite verification data, refined analytic obstructions, and signed specializations are recorded in the supplementary material.

comments
25 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.21657 ↗