Generic graph geometric control conjecture for the Schrödinger equation

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}, and (GGCC) denotes the graph geometric control condition.

Generic Schrödinger control conjecture. Generically with respect to the lengths (i)i=1,,N(\ell_i)_{i=1,\dots,N}, (GGCC) is a necessary and sufficient condition for the internal control of the Schrödinger equation.

The statement is motivated by the known necessity and sufficiency result for generic star graphs and by the existence of exceptional configurations where (GGCC) is not necessary. Its extension to almost all graphs 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.