Ising model on a general Cayley tree with competing next-nearest-neighbour interactions

• Main Authors: Ganikhodjaev, Nasir, Zakaria, Siti Fatimah
• Format: Conference or Workshop Item
• Language: English
• Published: 2011
• Subjects: QA Mathematics; QC Physics
• Online Access: http://irep.iium.edu.my/1716/2/Ising_Model_on_a_General_Cayley_Tree_with_Competing_Next-nearest-neighbour_Interactions.pdf; http://irep.iium.edu.my/1716/; http://dl.globalstf.org/index.php?page=shop.product_details&flypage=flypage_images.tpl&product_id=624&category_id=47&option=com_virtuemart&Itemid=4

We study the Ising model on a general Cayley tree of arbitrary order and produce the phase diagram with competing interactions prolonged next-nearest-neighbour Jp and one-level k-tuple next-nearest-neighbour Jo . Vannimenus proved the existence of modulated phase in the phase diagram of Ising model with competing nearest-neighbour interaction J1 and prolonged next-nearest-neighbour interactions Jp, as found for similar models on periodic lattices. Later Mariz et al generalized this result for Ising model with Jo ≠ 0. For a given lattice model on a Cayley tree, i.e., Jp ≠ 0; Jo ≠ 0 with J1 = 0, we describe the general equation, phase diagram and clarify the role of nearest-neighbour interaction J1. In the presence of nearest-neighbour interaction J1, Vannimenus demonstrated that for arbitrary random initial data one can reach the same phase diagram. We show that in the case J1 = 0 the set of all possible initial data can reach different phase diagrams