← All problems

Lyapunov-exponent upper bound for permanent saturation of metric graphs

1 year old · traced to

Let G=(V,E,l)G=(V,E,l) be a connected metric graph endowed with an interval exchange transformation TT partitioning GG into nn intervals with lengths ℓ1,ℓ2,…,ℓn\ell_1, \ell_2, \ldots, \ell_n linearly independent over Q\mathbb{Q}. Suppose μ\mu is the Lebesgue measure preserved by TT. Let τs\tau_s denote the saturation time, let ε\varepsilon be the accuracy parameter, and let KK be a graph-dependent constant. Let λ1≥⋯≥λn−1\lambda_1 \geq \dots \geq \lambda_{n-1} be the non-negative Lyapunov exponents of TT. Lyapunov-exponent saturation conjecture. The saturation time satisfies

τs≤K⋅exp⁡(∑i=1n−1λi)ε(log⁡(K⋅exp⁡(∑i=1n−1λi))−log⁡ε)n−1.\tau_s \leq \frac{K \cdot \exp\left(\sum_{i=1}^{n-1}\lambda_i\right)}{\varepsilon}\left(\log\left(K \cdot \exp\left(\sum_{i=1}^{n-1}\lambda_i\right)\right)-\log\varepsilon\right)^{n-1}.

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
  1. 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

Never refreshed

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.