Observable sets for Schr\"odinger equations on combinatorial graphs
Analysis of PDEs
2026-05-12 v3 Combinatorics
Abstract
We study observable sets for Schr\"odinger equations on combinatorial graphs. For one-dimensional lattice Schr\"odinger operators with as , we prove that a set is observable at some time, equivalently at any time, if and only if it satisfies a local arithmetic condition. This reveals an arithmetic obstruction absent from the Euclidean theory, where thickness is the decisive condition. The same criterion also characterizes observability for the corresponding heat equation on . In higher-dimensional lattices, we prove observability from the complement of any finite set. We further obtain arithmetic criteria on discrete tori, showing that positive density alone does not ensure observability.
Cite
@article{arxiv.2511.10358,
title = {Observable sets for Schr\"odinger equations on combinatorial graphs},
author = {Zhiqiang Wan and Heng Zhang},
journal= {arXiv preprint arXiv:2511.10358},
year = {2026}
}
Comments
27 pages, 1 figure