Eigenvalue estimates for Schrödinger operators on metric trees (Q633612)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5871183
Language Label Description Also known as
default for all languages
No label defined
    English
    Eigenvalue estimates for Schrödinger operators on metric trees
    scientific article; zbMATH DE number 5871183

      Statements

      Eigenvalue estimates for Schrödinger operators on metric trees (English)
      0 references
      0 references
      0 references
      0 references
      29 March 2011
      0 references
      The authors consider the Schrödinger operator \(-\Delta - V\) on an infinite rooted metric tree \(\Gamma\) with Neumann boundary condition. The graph and the potential are assumed to be radial, that is, the number of branches emanating from vertices having the same distance from the root is the same, and all branches emanating from these vertices have the same length, and for \(x\in\Gamma\), the value \(V(x)\) depends only on the distance of \(x\) to the root. For such graphs, the authors prove Lieb-Thirring inequalities and Cwikel-Lieb-Rozenblum inequalities for the negative eigenvalues of the Schrödinger operator. In the proofs, a decomposition of the Schrödinger operator on the graph in one-dimensional Schrödinger operators with metric and corresponding inequalities for these one-dimensional operators is used.
      0 references
      Schrödinger operators
      0 references
      metric tree
      0 references
      Lieb-Thirring inequality
      0 references
      Cwikel-Lieb-Rozenblum inequality
      0 references
      eigenvalue estimates
      0 references
      weighted Hardy-Sobolev inequalities
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references