Metraipolis › archive › dc_3f686b8a2de5

Polynomial positivity cones for Coxeter roots and walks in trees — arXiv:2609.11323

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11323
License (as archived)
CC0-1.0
Archived
2026-10-16T06:13:51.759Z
SHA-256 of the archived text
b46cee89736a5bc9a083250bd6b0d81d98874b72ad36e277988f66e3c7d8b975
Stable URL of this page
https://metraipolis.com/documento/dc_3f686b8a2de5

How to cite

Polynomial positivity cones for Coxeter roots and walks in trees — arXiv:2609.11323 — arXiv (en), https://arxiv.org/abs/2609.11323 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3f686b8a2de5 (Metraipolis archive dc_3f686b8a2de5, sha256 b46cee89736a5bc9a083250bd6b0d81d98874b72ad36e277988f66e3c7d8b975)
BibTeX
@misc{dc3f686b8a2de5,
  title = {Polynomial positivity cones for Coxeter roots and walks in trees — arXiv:2609.11323},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11323},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3f686b8a2de5; sha256 b46cee89736a5bc9a083250bd6b0d81d98874b72ad36e277988f66e3c7d8b975},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11323. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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äubig, 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$; for $n\ge3$, equality holds if and only if $T$ is a star and $k$ is even, whereas for $n=1$ or $n=2$, equality holds for every $k\ge1$. For non-Dynkin trees and even indices, the proof is based on a polynomial positivity cone associated with the adjacency operator of a finite graph and a positive real root of its simply-laced Coxeter system. For finite connected bipartite non-Dynkin graphs, we establish sufficient positivity conditions in terms of Coxeter orbits and inversion sets, and verify these conditions for indicator roots supported on connected induced subtrees. For non-Dynkin trees, this yields the rooted even-index inequality and, after summation, the corresponding global inequality. We also prove that if $G$ is a finite connected bipartite non-Dynkin simple graph, $\varnothing\ne U\subseteq V(G)$, and the subgraph of $G$ induced by $U$ is a tree, then $|U|w_{k+1}(G,U)-2(|U|-1)w_k(G,U)\ge0$ for every $k\ge0$, where $w_k(G,U)$ counts the length-$k$ walks in $G$ whose initial and terminal vertices lie in $U$; the intermediate vertices are unrestricted. The remaining even-index cases for finite Dynkin trees are handled by generating-function recurrences, while the odd-index cases follow from a spectral covariance identity.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11323 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:59:08.301Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).