Lattice models on Cayley tree with competing interactions

The existence of competing interactions lies at the heart of a variety of original phenomena in magnetic systems, ranging from the spin-glass transitions found in many disordered materials to the modulated phases with an infinite number of commensurate regions, that are observed in certain models wi...

Full description

Saved in:
Bibliographic Details
Main Author: Ganikhodjaev, Nasir
Format: Conference or Workshop Item
Language:English
Published: 2017
Subjects:
Online Access:http://irep.iium.edu.my/60159/1/60159_Abstract.pdf
http://irep.iium.edu.my/60159/
http://imfp2017.ifm.org.my/list-of-participants/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The existence of competing interactions lies at the heart of a variety of original phenomena in magnetic systems, ranging from the spin-glass transitions found in many disordered materials to the modulated phases with an infinite number of commensurate regions, that are observed in certain models with periodic interactions. The similarity of results obtained for models defined on Cayley trees and on crystal lattices is a strong motivation for the study of models on trees, since the statistical mechanics on trees presents many simplifying aspects that are absent in models defined on crystal lattices. This suggests that more complicated models should be studied on trees first, with the hope to discover new phases or unusual types of behaviour. The important point is that statistical mechanics on trees involve nonlinear recursion equationsand are naturally connected to the rich world of dynamical systems, a world presently under intense investigation. We consider the following kinds of bonds on the Cayley tree: the first-, second- and third nearest neighbors, where spins for second- and third nearest neighbors can belong to the same branch of the tree as well as different branches. In our talk we review well-known results about models on Cayley tree with competing interactions on the first-, second- and third nearest neighbors, and present some new results.