Eigenvalue spectrum conjecture for type j,kj,k saddle-node ghosts

Less than 1 year old · traced to

Let x˙=f(x,ρ)\dot{x}=f(x,\rho), with x∈Rnx\in\mathbb{R}^n, f∈Cωf\in\mathcal{C}^\omega, and parameters ρ=(ρ1,…,ρm)T∈Rm\rho=(\rho_1,\dots,\rho_m)^T\in\mathbb{R}^m. Suppose that xg∈Ax_g\in\mathcal{A} is a ghost of a type j,kj,k saddle-node xsnx_{sn} at ρcrit\rho_{\textnormal{crit}}. For each ii with 1≤i≤j1\leq i\leq j, there is a unit vector ui∈Rnu_i\in\mathbb{R}^n such that, in a neighborhood of xgx_g, the eigenvalues λi\lambda_i of Dxf(x,ρ)D_xf(x,\rho) along the line

{x∈A∣xg+tui, t∈R}\{x\in\mathcal{A}\mid x_g+tu_i,\ t\in\mathbb{R}\}

vary continuously and change sign from negative to positive, with

λi(t)≈ct,\lambda_i(t)\approx ct,

where c∈Rc\in\mathbb{R}, to leading order. Eigenvalue spectrum conjecture. Every type j,kj,k saddle-node ghost has, along each of jj suitable directions, a continuously varying eigenvalue that changes sign from negative to positive and is linear in the direction parameter to leading order. This conjecture formalizes the observed linear spatial distribution of instantaneous eigenvalues along the former center directions of the parental saddle-node. It is proposed as an algorithmically identifiable criterion for detecting and characterizing higher-dimensional ghosts; the supplied text does not establish its resolution.

References

Primary source

Daniel Koch and Akhilesh P. Nandan, “Generalized saddle-node ghosts and their composite structures in dynamical systems”, arXiv:2604.05194 (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.