Jia-Sheng Zeng

Polynomial positivity cones for Coxeter roots and walks in trees

For a finite simple graph $G$ and an integer $k\ge0$, let $w_k(G)$ denote the number of walks of length $k$. We prove the conjecture of T\"aubig, Weihmann, Kosub, Hemmecke, and Mayr for every finite tree and determine all equality cases. If $T$ has $n\ge1$ vertices, then $n w_{k+1}(T)-2(n-1)w_k(T)\ge0$ for every $k\ge1...