Convergence of the minimizing flow on acyclic quivers

The minimizing flow of Haiden, Katzarkov, Kontsevich and Pandit recovers the Harder–Narasimhan filtration of every nonzero representation of a finite acyclic quiver from the exponential decay rates of its Hermitian metric h(t). This holds for all vertex charges in the upper half-plane and every initial metric. If v lies in the kth filtration step outside the preceding one and Zₖ is the central charge of the kth quotient, then t⁻¹ log h(t)(v,v) tends to - arg Zₖ. The mass of the evolving metric tends to Σₖ |Zₖ|. On each quotient the metric rescaled by exp(t arg Zₖ) converges exponentially to a harmonic metric if the quotient is polystable. In general the rescaled metric stays at bounded distance from a Kempf–Ness gradient trajectory with vertex weights proportional to the imaginary parts of the charges. The iterated-logarithm asymptotics of Haiden, Katzarkov, Kontsevich and Pandit therefore apply up to bounded factors. For two-term complexes with nonzero cohomology concentrated in degree zero and differential supported at one vertex, the same results hold on cohomology when the phase is taken from the polar decomposition. For generalized Kronecker quivers the results extend to bounded complexes whose differentials vanish at one vertex, with the phases shifted by -π n in degree n. Under Beilinson's equivalence this includes every object of Dᵇ(ℙ¹) in a minimal projective or injective Kronecker model.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24341618
Citations
2
Primary Topic
Algebraic structures and combinatorial models
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Convergence of the minimizing flow on acyclic quivers

Bernd Johannes Wuebben
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Algebraic structures and combinatorial models
preprint

Convergence of the minimizing flow on acyclic quivers

Bernd Johannes Wuebben
preprint en
2 citations

Abstract

The minimizing flow of Haiden, Katzarkov, Kontsevich and Pandit recovers the Harder–Narasimhan filtration of every nonzero representation of a finite acyclic quiver from the exponential decay rates of its Hermitian metric h(t). This holds for all vertex charges in the upper half-plane and every initial metric. If v lies in the kth filtration step outside the preceding one and Zₖ is the central charge of the kth quotient, then t⁻¹ log h(t)(v,v) tends to - arg Zₖ. The mass of the evolving metric tends to Σₖ |Zₖ|. On each quotient the metric rescaled by exp(t arg Zₖ) converges exponentially to a harmonic metric if the quotient is polystable. In general the rescaled metric stays at bounded distance from a Kempf–Ness gradient trajectory with vertex weights proportional to the imaginary parts of the charges. The iterated-logarithm asymptotics of Haiden, Katzarkov, Kontsevich and Pandit therefore apply up to bounded factors. For two-term complexes with nonzero cohomology concentrated in degree zero and differential supported at one vertex, the same results hold on cohomology when the phase is taken from the polar decomposition. For generalized Kronecker quivers the results extend to bounded complexes whose differentials vanish at one vertex, with the phases shifted by -π n in degree n. Under Beilinson's equivalence this includes every object of Dᵇ(ℙ¹) in a minimal projective or injective Kronecker model.

Zenodo (CERN European Organization for Nuclear Research)
Algebraic structures and combinatorial models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon