Lyapunov-exponent upper bound for permanent saturation of metric graphs
Let be a connected metric graph endowed with an interval exchange transformation partitioning into intervals with lengths linearly independent over . Suppose is the Lebesgue measure preserved by . Let denote the saturation time, let be the accuracy parameter, and let be a graph-dependent constant. Let be the non-negative Lyapunov exponents of . Lyapunov-exponent saturation conjecture. The saturation time satisfies
The conjectural bound is motivated by the proposed relationship between saturation time and Lyapunov-exponent growth, but the source reports only numerical support and does not establish the inequality.
References
- Egor Ermolaev, Vsevolod Chernyshev and Alexandra Skripchenko, “Upper Bound for Permanent Saturation of Metric Graphs using Interval Exchange Transformations”, arXiv:2512.13851 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.