Hard rigid rods on Husimi lattices
Lucas R. Rodrigues, Tiago J. Oliveira, and J\"urgen F. Stilck

TL;DR
This study analyzes the phase transitions of hard rigid rods on Husimi lattices, revealing isotropic-nematic transitions for rods of size four or more, with transition types and critical parameters depending on lattice geometry.
Contribution
It provides the first detailed analysis of rod behavior on Husimi lattices, showing how lattice structure influences phase transition nature and critical parameters.
Findings
Isotropic phase for dimers and trimers; nematic transition for rods of size ≥4.
Continuous transition in square Husimi lattice; discontinuous in triangular.
Critical activities and densities decrease with rod size; entropy closely matches exact results.
Abstract
We study the thermodynamic behavior of hard rigid rods of size (i.e., -mers) on four- and six-coordinated Husimi lattices (HLs), respectively built with squares (square HL) and triangles (triangular HL). In both lattices, dimers () and trimers () only present a isotropic phase, whereas a isotropic-nematic transition is observed for . In the square HL, this transition is continuous and occurs at a critical \textit{monomer} activity which displays a nonmonotonic variation with , while the critical \textit{rod} activity and density are always decreasing functions of . The isotropic-nematic transition is discontinuous in the triangular HL, but the -dependence of the coexistence activities and density is analogous to that found for the square case. No transition from the nematic to a high-density disordered phase is found in these HLs. In general, this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Robotic Path Planning Algorithms
