Total positivity from a kind of lattice paths
Yu-Jie Cui, Bao-Xuan Zhu

TL;DR
This paper investigates total positivity of matrices generated by weighted lattice paths, establishing conditions under which total positivity holds and applying these results to various well-known combinatorial matrices.
Contribution
It introduces algebraic and combinatorial methods to prove total positivity for matrices from lattice paths, including new results on Toeplitz matrices and applications to classical combinatorial triangles.
Findings
Proves total positivity of matrices generated by specific lattice path weights.
Establishes conditions for Toeplitz total positivity of row sequences.
Shows many classical combinatorial matrices are totally positive.
Abstract
Total positivity of matrices is deeply studied and plays an important role in various branches of mathematics. The main purpose of this paper is to study total positivity of a matrix generated by the weighted lattice paths in from the origin to the point consisting of types of steps: and for , where each step from height~ gets the weight~ and each step from height~ gets the weight . Using an algebraic method, we prove that the -total positivity of the weight matrix implies that of . Furthermore, using the Lindstr\"{o}m-Gessel-Viennot lemma, we obtain that both and the Toeplitz matrix of each row sequence of with are -totally positive under the following…
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.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Mathematics and Applications
