Total positivity of Riordan arrays
Xi Chen, Huyile Liang, Yi Wang

TL;DR
This paper establishes conditions under which Riordan arrays are totally positive, demonstrating that many classical combinatorial triangles possess this property and that numerous well-known combinatorial numbers are log-convex.
Contribution
It provides a unified framework for proving total positivity of Riordan arrays and related combinatorial numbers, expanding understanding of their structural properties.
Findings
Many classical combinatorial triangles are totally positive.
Numerous combinatorial numbers are shown to be log-convex.
The paper offers sufficient conditions for total positivity in Riordan arrays.
Abstract
We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
