Relative monotonicity of secular determinants of quantum graphs Present by Yaqi Dai Supervisor : Professor Berkolaiko Motivation ο΄ Quantum graph provides useful models for complex systems in the fields of natural science, engineering and social sciences ο΄ In the long term, our project is to find a more efficient algorithm of computing eigenvalues of quantum graphs ο΄ we conjectured that the secular determinants of quantum graphs are relatively monotonic Background DEFINITION: Quantum graph (V,E) ,where V is the set of vertices and E is the set of edges, is a metric graph equipped with a Hamiltonian operator H (1) , accompanied by “appropriate” vertex conditions (2). ο΄ eigenvalue equation for the Schrödinger operator: (1) π2 π − 2 ππ₯ + π π₯ β π π₯ = π 2 β π(π₯) ο΄ (2) Vertex conditions: ο΄ Neumann condition: π π₯ is continuous on and at each vertex v one has ο΄ Dirichlet condition: π π₯ is continuous on and π π£ =0 ππ π∈πΈπ£ ππ₯ (π£) π =0 A trivial example: interval (1) πΏ π π₯ ≡ 0; Solution for −π ′′ = π 2 π on πΏ: π΄ π΅ (2) π π₯ = πΆ1 cos ππ₯ + πΆ2 sin(ππ₯) Apply vertex conditions: Figure 1. interval [0,L], Neumann condition on endpoints A,B, and 0 corresponding A ; (3) π′ 0 = 0 (4) −π ′ πΏ = 0 we can solve eigenvalues: (5) ππ π 2 = ( πΏ )2 ,π ∈ π Example: Lasso graph Solution for −π ′′ = π 2 π on πΏ1 , πΏ2 : 2 1 π΄ πΏ1 πΏ2 π΅ 1 2 Figure 2. (V,E) Lasso graph V={A,B} ; E={[0, πΏ1 ], [0, πΏ2 ]} where 0 corresponding connected point ; Neumann condition on vertices (6) π1 = π1 β π πππ₯ + π1 β π ππ(πΏ1−π₯) (7) π2 = π2 β π πππ₯ + π2 β π ππ(πΏ2−π₯) Apply vertex condition: (8) −π1′ πΏ1 = −πππ1 π πππΏ1 + πππ1 = 0 (9) π1′ 0 + π2′ 0 − π2′ πΏ2 = 0 (10) π1 0 = π2 0 = π2 (πΏ2 ) Example: Lasso graph 2 1 π΄ We get the system πΏ1 πΏ2 π΅ 1 2 3 2 3 π1 = (12) π1 = π1 π πππΏ1 (13) π2 = 2 π1 π πππΏ1 3 + π2 π πππΏ2 − π2 π πππΏ2 (14) π2 = 2 π1 π πππΏ1 3 − π2 π πππΏ2 + π2 π πππΏ2 2 Figure 2. (V,E) Lasso graph V={A,B} ; E={[0, πΏ1 ], [0, πΏ2 ]} where 0 corresponding connected point ; Neumann condition on vertices 1 3 − π1 π πππΏ1 + π2 π πππΏ2 + π2 π πππΏ2 (11) 2 3 1 3 1 3 2 3 Example: Lasso graph 2 1 π΄ The system can be written as: (15) πΏ1 πΏ2 π΅ 1 2 Figure 2. (V,E) Lasso graph V={A,B} ; E={[0, πΏ1 ], [0, πΏ2 ]} where 0 corresponding connected point ; Neumann condition on vertices Notation: π π·(π) π 2 (π ≠ 0) is the eigenvalue of the graph iff πππ π° − πΊπ« π = π, we call the determinant secular determinant. Secular determinant (Neumann condition graph) For the general Neumann condition graph (V,E), first consider the single vertex in (V,E), which has d edges attach to it. Denote the length of j-th edge is πΏπ , the solution on j-th edge: (16) ππ = ππ β π πππ₯ + ππ β π ππ(πΏπ −π₯) Apply the vertex condition: (17) (18) π π=1 ππ − π πππΏπ π=1 ππ π =0 ππ + ππ π πππΏπ = ππ + ππ π πππΏπ , for ∀π, π ∈ π ∗ πππ π, π ≤ π By (16)&(17)&(18) we solving ππ for 1 ≤ π ≤ π: (19) Figure 3. a vertex with Neumann condition c ππ = −ππ π πππΏπ + 2 π π πππΏπ π=1 ππ π Secular determinant (Neumann condition graph) Then we consider the whole graph π π, πΈ π In the 2|E|-dimensional complex space, with dimensions indexed by the directed edges. we get 2 πΈ × 2|πΈ| matrix S and D(k)for π, πΈ : (20) π·(π)π,π = π πππΏπ (21) ππ′ ,π = The secular determinant is πππ π° − πΊπ« π 2 −1 π if π′ = π 2 π if π′ follows π and π′ ≠ π 0 otherwise Proposal ο΄ Change a vertex condition (Neumann condition to Dirichlet condition ) e.g. π′ π Figure 4. Conjecture: Define a quantum graph π with Neumann condition on its vertices, obtained the quantum graph π ′ by changing one of the vertices condition to Dirichlet condition. Define π π = det(πΌ−ππ π·π (π)) det(πΌ−ππ′ π·π′ (π)) , and f(k) derivatives except the location where π 2 is eigenvalue of π ′ . p o l e s has negative . Application π′ π ππ′ ππ Graph 1. part of the graph for f(k) ′ ππ+1 det(πΌ − ππ π·π (π)) π π = det(πΌ − ππ′ π·π′ (π)) There is only one eigenvalue lies between two poles and the derivative is always negative. Using Secant Algorithm can easily solve this eigenvalue Application …… To find the eigenvalues of a complicated quantum graph, we can always “break it down” into trivial intervals, and iteratively we solve the eigenvalues. Acknowledgement Supervisor: Professor Berkolaiko An analogous result in the case of matrix Theorem: Define a vector π ∈ πΆ π , obtained matrix B by π΅ = π β π π , for any real det(π΄+π΅−ππΌ) Hermitian matrix π΄ ∈ πΆ π×π , we have the function π π = det(π΄−ππΌ) has negative derivatives except for the locations λ is the eigenvalue for A. Secular Determinant π′ π ππ′ ,π = 0 π ππ′ ,π = 2 −1 π if π′ = π ππ′ ,π = 2 π if π′ follows π and π′ ≠ π π π π′