Matrix products of binomial coefficients and unsigned Stirling numbers
Combinatorics
2025-09-30 v1
Abstract
We study sums of the form , where and are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common features: combinatorial interpretations, Pascal-like recurrences, inverse relations with their signed versions, and interpretations as coefficients of change between polynomial bases.
Cite
@article{arxiv.2012.15307,
title = {Matrix products of binomial coefficients and unsigned Stirling numbers},
author = {Marin Knežević and Vedran Krčadinac and Lucija Relić},
journal= {arXiv preprint arXiv:2012.15307},
year = {2025}
}
Comments
10 pages