{"paper":{"title":"Uncertainty principle for discrete Schr\\\"odinger evolution on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Isaac Alvarez-Romero","submitted_at":"2016-11-16T17:39:04Z","abstract_excerpt":"We consider the Schr\\\"odinger evolution on graph, i.e. solution to the equation $\\partial_tu(t,\\alpha)=i\\sum_{\\beta\\in\\mathcal{A}}L(\\alpha,\\beta)u(t,\\beta)$, here $\\mathcal{A}$ is the set of vertices of the graph and the matrix $(L(\\alpha,\\beta))_{\\alpha,\\beta\\in\\mathcal{A}}$ describes interaction between the vertices, in particular two vertices $\\alpha$ and $\\beta$ are connected if $L(\\alpha,\\beta)\\neq0$. We assume that the graph has a \"web-like\" structure, i.e, it consists of an inner part, formed by a finite number of vertices, and some threads attach to it.\nWe prove that such solution $u(t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05381","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}