2000 character limit reached
Non-self-adjoint graphs
Published 20 Aug 2013 in math.SP, math-ph, math.MP, and quant-ph | (1308.4264v1)
Abstract: On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity transforms to self-adjoint Laplacians. Among other things, we describe a simple way how to relate the similarity transforms between Laplacians on certain graphs with elementary similarity transforms between matrices defining the boundary conditions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.