A planar network proof for Hankel total positivity of type B Narayana polynomials
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5ELRUGEDrecord.jsonopen to challenge →
classification
math.CO
keywords
networkplanarproofhankelnarayanapolynomialstypeallowing
read the original abstract
The Hankel matrix of type B Narayana polynomials was proved to be totally positive by Wang and Zhu, and independently by Sokal. Pan and Zeng raised the problem of giving a planar network proof of this result. In this paper, we present such a proof by constructing a planar network allowing negative weights, applying the Lindstr\"om-Gessel-Viennot lemma and establishing an involution on the set of nonintersecting families of directed paths.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.