Generic small-time null-controllability conjecture for the heat equation on graphs

Let G\mathcal{G} be a graph with NN edges (ei)i=1,,N(e_i)_{i=1,\dots,N} and let ω\omega be an open subset of G\mathcal{G}. The lengths of the edges are (i)i=1,,N(\ell_i)_{i=1,\dots,N}.

Generic heat-control conjecture. Generically with respect to the lengths (i)i=1,,N(\ell_i)_{i=1,\dots,N}, the heat equation is small-time null-controllable.

The claim is presented as a natural extension of the stated result for generic star graphs, where small-time null-controllability holds for every T>0T>0. Its validity for more general graph structures remains open.

Sources & referencesView supporting material

Primary source

Kaïs Ammari, Alessandro Duca, Romain Joly and Kévin Le Balc'h, “The Graph Geometric Control Condition”, arXiv:2503.18864 (2025).

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.