Abstract
We consider the spectral gap question for Affleck, Kennedy, Lieb, and Tasaki models defined on decorated versions of simple, connected graphs G. This class of decorated graphs, which are defined by replacing all edges of G with a chain of n sites, in particular includes any decorated multi-dimensional lattice. Using the Tensor Network States approach from [Abdul-Rahman et al., Analytic Trends in Mathematical Physics, Contemporary Mathematics (American Mathematical Society, 2020), Vol. 741, p. 1.], we prove that if the decoration parameter is larger than a linear function of the maximal vertex degree, then the decorated model has a nonvanishing spectral gap above the ground state energy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
