Chebyshev type lattice path weight polynomials by a constant term method
R. Brak, J. Osborn

TL;DR
This paper introduces a constant term theorem for calculating weight polynomials of lattice paths with decorated weights, utilizing orthogonal polynomials and combinatorial methods, with applications in polymer physics.
Contribution
It presents a new constant term theorem for lattice path weight polynomials, an efficient method for explicit polynomial expressions of non-classical orthogonal polynomials, and a novel proof of Viennot's theorem using transfer matrix diagonalization.
Findings
Derived a constant term theorem for lattice path weights.
Developed a method for explicit orthogonal polynomial expressions.
Applied the method to polymer physics lattice path problems.
Abstract
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like Viennot's lattice path theorem from which it is derived primarily by a change of variable lemma, is expressed in terms of orthogonal polynomials which in our applications of interest often turn out to be non-classical. Hence we also present an efficient method for finding explicit closed form polynomial expressions for these non-classical orthogonal polynomials. Our method for finding the closed form polynomial expressions relies on simple combinatorial manipulations of Viennot's diagrammatic representation for orthogonal polynomials. In the course of the paper we also provide a new proof of Viennot's original orthogonal polynomial lattice path theorem.…
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.
