Generic small-time null-controllability conjecture for the heat equation on graphs
Generic small-time null-controllability conjecture for the heat equation on graphs
Let be a graph with edges and let be an open subset of . The lengths of the edges are .
Generic heat-control conjecture. Generically with respect to the lengths , 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 . 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
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.