Planar networks and total positivity of Riordan arrays
Abstract
In 2015, Chen, Liang and Wang provided several sufficient conditions for the total positivity of Riordan arrays and asked for combinatorial proofs of these results. In this paper, we present such proofs by constructing suitable planar networks with non-negative weights and applying the Lindstr\"om-Gessel-Viennot lemma. Moreover, we slightly generalize one of the results and give more totally positive Riordan arrays.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.