PreprintarXiv licencearXiv
The Higher-order Stirling Triangles
Abstract
The rth-order Stirling cycle and subset triangles and their associated quasi-Eulerian triangles were introduced by Deb and Sokal in their study of total positivity of combinatorial triangles. They found combinatorial interpretations for the cycle case in terms of Stirling permutations, leaving the subset case open. For r≥ 2, we resolve this problem by introducing the notion of Stirling subset permutations along with a consecutive-descent statistic. We also prove the conjectures of Deb and Sokal on the row log-concavity of the higher-order Stirling cycle and subset triangles. Our log-concavity proofs rely on Sagan's criterion, Dey's extension, and strengthened log-concavity inequalities discovered with the assistance of ChatGPT 5.6.
Related
- Higher-order differentiability of Korevaar--Schoen energy forms and energy measures
- Higher-order convex orders under free multiplicative convolution
- Stable Solutions to Generalizations of Fibonacci Relations of Higher Order
- Equivalence of freeness and higher order freeness of hyperplane arrangements
- Higher order pointwise estimates for intermediate derivative
BibTeX
@misc{chen2026higherorder,
title = {{The Higher-order Stirling Triangles}},
author = {William Y. C. Chen and Elena L. Wang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09362},
eprint = {2610.09362},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09362},
}
RIS
TY - UNPB
TI - The Higher-order Stirling Triangles
AU - William Y. C. Chen
AU - Elena L. Wang
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.09362
UR - https://arxiv.org/abs/2610.09362
AB - The rth-order Stirling cycle and subset triangles and their associated quasi-Eulerian triangles were introduced by Deb and Sokal in their study of total positivity of combinatorial triangles. They found combinatorial interpretations for the cycle case in terms of Stirling permutations, leaving the subset case open. For r≥ 2, we resolve this problem by introducing the notion of Stirling subset permutations along with a consecutive-descent statistic. We also prove the conjectures of Deb and Sokal on the row log-concavity of the higher-order Stirling cycle and subset triangles. Our log-concavity proofs rely on Sagan's criterion, Dey's extension, and strengthened log-concavity inequalities discovered with the assistance of ChatGPT 5.6.
ER -