The finite constant-solution conjecture for deterministic state-space systems

Let \Scdet\,\Sc^{\mathrm{det}} denote the set of deterministic state–input solutions of a state-space system, let \US\US^- be its input sequence space, and let #\Scdet(\Sequ)\#\Sc^{\mathrm{det}}(\Seq{u}) denote the number of solutions associated with an input \Sequ\Seq{u}. The system has the finite-memory property (FMP) when its solutions are determined by their input histories.

Finite constant-solution conjecture. If #\Scdet(\Sequ)\#\Sc^{\mathrm{det}}(\Seq{u}) is constant on \US\US^- and this constant is finite, then the state-space system has the FMP.

The conjecture proposes the converse of the result that the FMP implies a constant number of solutions. Its status is not specified in the source.

Sources & referencesView supporting material

Primary source

Juan-Pablo Ortega and Florian Rossmannek, “Stochastic dynamics learning with state-space systems”, arXiv:2508.07876 (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.