The determinant flow of a graph with one weighted edge: degeneracies as fixed points
Let G be a connected graph and e = uv an edge such that G − e is of finite type. Putting a real weight λ on e gives a one-parameter Cartan-type form A(λ) whose determinant is a quadratic polynomial in λ. We show that its two roots r₋ < 0 < r₊ are (±√(dᵤdᵥ) − cₑ)/dᵤᵥ, where dᵤ, dᵥ, dᵤᵥ are determinants of the forms of G − u, G − v, G − u − v and cₑ ≥ 0 is a cofactor vanishing exactly when e is a bridge; that A(λ) is positive definite between them, of affine type at r₊, and Lorentzian outside; and that every edge of every simply laced affine Dynkin diagram has r₊ = 1. We then record what follows when the determinant is read as a vector field: the logistic equation whose attractor is the affine point, with rate −2√(dᵤdᵥ); on the Riemann sphere it is Möbius-linearisable, and the real orbits that leave to −∞ in finite time return from +∞. With k weighted edges the positive definite region is a bounded convex set.
Authors
- Jonathan Chauveau-Friggiati (ORCID: https://orcid.org/0009-0008-5072-9023)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24417474
- Primary Topic
- Algebraic structures and combinatorial models
- Type
- preprint