اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPoint Spectrum of Periodic Operators on Universal Covering Trees
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For any multi-graph $G$ with edge weights and vertex potential, and its universal covering tree $mathcal{T}$, we completely characterize the point spectrum of operators $A_{mathcal{T}}$ on $mathcal{T}$ arising as pull-backs of local, self-adjoint operators $A_{G}$ on $G$. This builds on work of Aomoto, and includes an alternative proof of the necessary condition for point spectrum he derived in (Aomoto, 1991). Our result gives a finite time algorithm to compute the point spectrum of $A_{mathcal{T}}$ from the graph $G$, and additionally allows us to show that this point spectrum is contained in the spectrum of $A_{G}$. Finally, we prove that typical pull-back operators have a spectral delocalization property: the set of edge weight and vertex potential parameters of $A_{G}$ giving rise to $A_{mathcal{T}}$ with purely absolutely continuous spectrum is open and its complement has large codimension.
قيم البحث
اقرأ أيضاً
We show that a generic quasi-periodic Schrodinger operator in $L^2(mathbb{R})$ has purely singular spectrum. That is, for any minimal translation flow on a finite-dimensional torus, there is a residual set of continuous sampling functions such that f
or each of these sampling functions, the Schrodinger operator with the resulting potential has empty absolutely continuous spectrum.
We consider Schroedinger operators on regular metric trees and prove Lieb-Thirring and Cwikel-Lieb-Rozenblum inequalities for their negative eigenvalues. The validity of these inequalities depends on the volume growth of the tree. We show that the bo
unds are valid in the endpoint case and reflect the correct order in the weak or strong coupling limit.
We study perturbations of the self-adjoint periodic Sturm--Liouville operator [ A_0 = frac{1}{r_0}left(-frac{mathrm d}{mathrm dx} p_0 frac{mathrm d}{mathrm dx} + q_0right) ] and conclude under $L^1$-assumptions on the differences of the coefficient
s that the essential spectrum and absolutely continuous spectrum remain the same. If a finite first moment condition holds for the differences of the coefficients, then at most finitely many eigenvalues appear in the spectral gaps. This observation extends a seminal result by Rofe-Beketov from the 1960s. Finally, imposing a second moment condition we show that the band edges are no eigenvalues of the perturbed operator.
We consider Schrodinger operators with periodic electric and magnetic potentials on periodic discrete graphs. The spectrum of such operators consists of an absolutely continuous (a.c.) part (a union of a finite number of non-degenerate bands) and a f
inite number of eigenvalues of infinite multiplicity. We prove the following results: 1) the a.c. spectrum of the magnetic Schrodinger operators is empty for specific graphs and magnetic fields; 2) we obtain necessary and sufficient conditions under which the a.c. spectrum of the magnetic Schrodinger operators is empty; 3) the spectrum of the magnetic Schrodinger operator with each magnetic potential $talpha$, where $t$ is a coupling constant, has an a.c. component for all except finitely many $t$ from any bounded interval.
Schrodinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely, under what c
onditions can a one-size-fits-all algorithm for computing their spectra be devised? It is shown that for periodic banded matrices this can be done, as well as for Schrodinger operators with periodic potentials that are sufficiently smooth. In both cases implementable algorithms are provided, along with examples. For certain Schrodinger operators whose potentials may diverge at a single point (but are otherwise well-behaved) it is shown that there does not exist such an algorithm, though it is shown that the computation is possible if one allows for two successive limits.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
