arXiv · 1410.5015
How the permutation of edges of a metric graph affects the number of points moving along the edges
Abstract
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schrödinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find a weak inequality representation for the number of points coming out of the vertex of an arbitrary tree graph. We apply this construction to an "H-junction" graph. We calculate the difference between numbers of moving points corresponding to the permutation of edges. Then we find a symmetrical difference of the number of points moving along the edges of a metric graph.
Explore related subjects
Keep this discovery
V. L. Chernyshev, A. A. Tolchennikov. 2014-10-18. How the permutation of edges of a metric graph affects the number of points moving along the edges. https://arxiv.org/abs/1410.5015
Cite the original work for its findings. Save a collection to share your selection of sources.