Thumbnail
Access Restriction
Open

Author Golenia, Sylvain
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2009-10-19
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Natural sciences & mathematics ♦ Mathematics ♦ Physics
Subject Keyword Mathematics - Functional Analysis ♦ Mathematical Physics ♦ Mathematics - Spectral Theory ♦ math ♦ physics:math-ph
Abstract Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We also consider the case of weighted graphs. We discuss the question of self-adjoint extensions and prove an optimal criterium.
Educational Use Research
Learning Resource Type Article


Open content in new tab

   Open content in new tab