اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVariational proof of the existence of eigenvalues for star graphs
147
0
0.0
(
0
)
تأليف
Konstantin Pankrashkin
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide a purely variational proof of the existence of eigenvalues below the bottom of the essential spectrum for the Schrodinger operator with an attractive $delta$-potential supported by a star graph, i.e. by a finite union of rays emanating from the same point. In contrast to the previous works, the construction is valid without any additional assumption on the number or the relative position of the rays. The approach is used to obtain an upper bound for the lowest eigenvalue.
قيم البحث
اقرأ أيضاً
We prove an analogue of the magnetic nodal theorem on quantum graphs: the number of zeros $phi$ of the $n$-th eigenfunction of the Schrodinger operator on a quantum graph is related to the stability of the $n$-th eigenvalue of the perturbation of the
operator by magnetic potential. More precisely, we consider the $n$-th eigenvalue as a function of the magnetic perturbation and show that its Morse index at zero magnetic field is equal to $phi - (n-1)$.
We consider inverse obstacle and transmission scattering problems where the source of the incident waves is located on a smooth closed surface that is a boundary of a domain located outside of the obstacle/inhomogeneity of the media. The domain can b
e arbitrarily small but fixed.The scattered waves are measured on the same surface. An effective procedure is suggested for recovery of interior eigenvalues by these data.
The operator associated to the angular part of the Dirac equation in the Kerr-Newman background metric is a block operator matrix with bounded diagonal and unbounded off-diagonal entries. The aim of this paper is to establish a variational principle
for block operator matrices of this type and to derive thereof upper and lower bounds for the angular operator mentioned above. In the last section, these analytic bounds are compared to numerical values from the literature.
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity) and its as
sociated eigenvector, the so-called Fiedler vector. Here we prove that, given a Laplacian matrix, it is possible to perturb the weights of the existing edges in the underlying graph in order to obtain simple eigenvalues and a Fiedler vector composed of only non-zero entries. These structural genericity properties with the constraint of not adding edges in the underlying graph are stronger than the classical ones, for which arbitrary structural perturbations are allowed. These results open the opportunity to understand the impact of structural changes on the dynamics of complex systems.
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the adjacency operato
r on an homogeneous tree. We developp this scattering theory using the classical recipes for Schrodinger operators in Euclidian spaces.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
