Prefer a chat interface with context about you and your work?
An Extension of the Lindström-Gessel-Viennot Theorem
Consider a weighted directed acyclic graph $G$ having an upward planar drawing. We give a formula for the total weight of the families of non-intersecting paths on $G$ with any given starting and ending points. While the Lindström-Gessel-Viennot theorem gives the signed enumeration of these weights (according to the connection …