PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Graph theory and the Jahn-Teller theorem
Tomaž Pisanski, Arnout Ceulemans, E. Lijnen, Patrick W. Fowler and Roger B. Mallion
Proceedings. Series A, Mathematical, Physical and Engineering Sciences 2011. ISSN 1364-5021

Abstract

The Jahn–Teller (JT) theorem predicts spontaneous symmetry breaking and lifting of degeneracy in degenerate electronic states of (nonlinear) molecular and solid-state systems. In these cases, degeneracy is lifted by geometric distortion. Molecular problems are often modelled using spectral theory for weighted graphs, and the present paper turns this process around and reformulates the JT theorem for general vertex- and edge-weighted graphs themselves. If the eigenvectors and eigenvalues of a general graph are considered as orbitals and energy levels (respectively) to be occupied by electrons, then degeneracy of states can be resolved by a non-totally symmetric re-weighting of edges and, where necessary, vertices. This leads to the conjecture that whenever the spectrum of a graph contains a set of bonding or anti-bonding degenerate eigenvalues, the roots of the Hamiltonian matrix over this set will show a linear dependence on edge distortions, which has the effect of lifting the degeneracy. When the degenerate level is non-bonding, distortions of vertex weights have to be included to obtain a full resolution of the eigenspace of the degeneracy. Explicit treatments are given for examples of the octahedral graph, where the degeneracy to be lifted is forced by symmetry, and the phenalenyl graph, where the degeneracy is accidental in terms of the automorphism group.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:9264
Deposited By:Boris Horvat
Deposited On:21 February 2012