اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMagnetic interpretation of the nodal defect on graphs
94
0
0.0
(
0
)
تأليف
Yves Colin De Verdi`ere
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this note, we present a natural proof of a recent and surprising result of Gregory Berkolaiko (arXiv 1110.5373) interpreting the Courant nodal defect of a Schrodinger operator on a finite graph as a Morse index associated to the deformations of the operator by switching on a magnetic field. This proof is inspired by a nice paper of Miroslav Fiedler published in 1975.
قيم البحث
اقرأ أيضاً
According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturms theorem for the strings applies to the theory of membranes: N-th eigenf
unction cannot have more than N domains. He also gave an example of a eigenfunction high in the spectrum with a minimal number of nodal domains, thus excluding the existence of a non-trivial lower bound. An analogue of Sturms result for discretizations of the interval was discussed by Gantmacher and Krein. The discretization of an interval is a graph of a simple form, a chain-graph. But what can be said about more complicated graphs? It has been known since the early 90s that the nodal count for a generic eigenfunction of the Schrodinger operator on quantum trees (where each edge is identified with an interval of the real line and some matching conditions are enforced on the vertices) is exact too: zeros of the N-th eigenfunction divide the tree into exactly N subtrees. We discuss two extensions of this result in two directions. One deals with the same continuous Schrodinger operator but on general graphs (i.e. non-trees) and another deals with discrete Schrodinger operator on combinatorial graphs (both trees and non-trees). The result that we derive applies to both types of graphs: the number of nodal domains of the N-th eigenfunction is bounded below by N-L, where L is the number of links that distinguish the graph from a tree (defined as the dimension of the cycle space or the rank of the fundamental group of the graph). We also show that if it the genericity condition is dropped, the nodal count can fall arbitrarily far below the number of the corresponding eigenfunction.
It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the distribution of the n
odal surplus) for Laplacian eigenfunctions of a metric graph. The existence of the distribution is established, along with its symmetry. One consequence of the symmetry is that the graphs first Betti number can be recovered as twice the average nodal surplus of its eigenfunctions. Furthermore, for graphs with disjoint cycles it is proven that the distribution has a universal form --- it is binomial over the allowed range of values of the surplus. To prove the latter result, we introduce the notion of a local nodal surplus and study its symmetry and dependence properties, establishing that the local nodal surpluses of disjoint cycles behave like independent Bernoulli variables.
A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing decomposition into Lyn
don words. This article extends this factorization theorem, obtaining the proportion of these decompositions that are strictly decreasing. This result is then used to count primitive pseudo orbits (sets of primitive periodic orbits) on q-nary graphs. As an application we obtain a diagonal approximation to the variance of the characteristic polynomial coefficients q-nary quantum graphs.
In this work we present a formalism of abstract quantum field theory for fat graphs and its realizations. This is a generalization of an earlier work for stable graphs. We define the abstract correlators $mathcal F_g^mu$, abstract free energy $mathca
l F_g$, abstract partition function $mathcal Z$, and abstract $n$-point functions $mathcal W_{g,n}$ to be formal summations of fat graphs, and derive quadratic recursions using edge-contraction/vertex-splitting operators, including the abstract Virasoro constraints, an abstract cut-and-join type representation for $mathcal Z$, and a quadratic recursion for $mathcal W_{g,n}$ which resembles the Eynard-Orantin topological recursion. When considering the realization by the Hermitian one-matrix models, we obtain the Virasoro constraints, a cut-and-join representation for the partition function $Z_N^{text{Herm}}$ which proves that $Z_N^{text{Herm}}$ is a tau-function of KP hierarchy, a recursion for $n$-point functions which is known to be equivalent to the E-O recursion, and a Schrodinger type-equation which is equivalent to the quantum spectral curve. We conjecture that in general cases the realization of the quadratic recursion for $mathcal W_{g,n}$ is the E-O recursion, where the spectral curve and Bergmann kernel are constructed from realizations of $mathcal W_{0,1}$ and $mathcal W_{0,2}$ respectively using the framework of emergent geometry.
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)$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
