2000 character limit reached
Simplicity of eigenvalues in Anderson-type models
Published 20 Jan 2010 in math-ph and math.MP | (1001.3440v1)
Abstract: We show almost sure simplicity of eigenvalues for several models of Anderson-type random Schr\"odinger operators, extending methods introduced by Simon for the discrete Anderson model. These methods work throughout the spectrum and are not restricted to the localization regime. We establish general criteria for the simplicity of eigenvalues which can be interpreted as separately excluding the absence of local and global symmetries, respectively. The criteria are applied to Anderson models with matrix-valued potential as well as with single-site potentials supported on a finite box.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.