The reducible-tree conjecture for time-periodic solutions
The reducible-tree conjecture for time-periodic solutions
Consider the nonlinear wave equations
and rewrite their time-periodic solutions as solutions of the associated infinite Galerkin algebraic system for the Fourier coefficients of and the oscillation frequency . A reducible tree is the structure obtained from a smaller subsystem of this Galerkin system, with trunks and branches, and its rescalings are taken according to the scaling in the source.
Reducible-tree conjecture. The infinite reducible tree and its rescalings according to the relevant scaling provide an effective description for the structure of time-periodic solutions to the equations above.
This conjecture proposes that the reducible-tree structures capture the overall bifurcation pattern of time-periodic solutions, including the way solutions develop across frequency gaps. The paper motivates it through detailed analysis of reducible systems and comparison with truncated Galerkin systems; the supplied text gives no resolution, so its status remains open.
Sources & referencesView supporting material
Primary source
Filip Ficek and Maciej Maliborski, “Trees, trunks, and branches – bifurcation structure of time-periodic solutions to u_tt-u_xxu^3=0”, arXiv:2408.05158 (2025).
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
Sign in to submit a solution.
No solutions have been posted yet.