Search arXiv⌕ Search

arXiv · 2610.24923

Frustration and topology in the phase behavior of solute-frustrated $q$-clock models

Abstract

Frustration can enhance fluctuations and create new and interesting phase behavior. When combined with the ability to host topological defects, frustration can increase the complexity of a system's phase diagram through topological and frustrated topological transitions. To understand the interplay of frustration and topology on phase behavior, we introduce and study solute-frustrated $q$-clock (SF$q$C) models, in which solute sites are added to the $q$-clock model, a lattice model where each spin can take one of $q$ orientations. The $q$-clock model can exhibit spontaneous symmetry breaking and topological transitions, and the interaction between the spins and a solute frustrates the system, in essence by creating a fixed lower bound on the concentration of positive topological defects or vortices. We perform Monte Carlo simulations and develop theoretical descriptions of SF$q$C models with $q=4$ and $q=6$ to understand their phase behavior. We find that these systems exhibit rich phase diagrams that depend on the choice of parameters. In particular, SF$q$C models have a wide range of interesting low-temperature phases, including the presence of strongly frustrated domains and the absence of long-range order. We also find topological effects even at low temperatures; for instance, we find that topological defects can drive crystallization. We anticipate these results to guide the development of materials that take advantage of frustration and topology to tune phase behavior and fluctuations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hari Rajesh, Richard C. Remsing. 2026-10-18. Frustration and topology in the phase behavior of solute-frustrated $q$-clock models. https://arxiv.org/abs/2610.24923

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Algebraic criteria for complete relaxation in autonomous and periodically driven open quantum systems

We derive sufficient criteria that guarantee convergence of open quantum system dynamics to a unique long-time state independent of the initial conditions. We refer to this behavior as complete relaxation. Focusing on systems described by Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equations on finite-dimensional Hilbert spaces, our approach uses only elementary mathematical arguments. For autonomous systems, we recover three previously derived relaxation criteria, which can be expressed as algebraic conditions on the Lindblad operators and the Hamiltonian entering the GKSL equation. For periodically driven systems, we obtain a new criterion involving a similar algebraic condition and a local continuity requirement on the time-dependent GKSL generator. This result implies an earlier criterion for complete relaxation formulated in Ref. [J. Phys. A 52, 43LT01 (2019)]. We also discuss implications of our approach for periodically modulated classical master equations, as well as extensions to driven systems without a periodicity constraint.

cond-mat.stat-mech↗

A universal emulator for planar Ising lattices

We introduce the notion of an Ising emulator for two-dimensional Ising models: a broad class of flat, unit-edge-length lattices can be represented as site- or bond-diluted supercells of a single host lattice, for which the Feynman--Vdovichenko/Kac--Ward solution is fixed once and for all. We construct explicit square and triangular emulators and show that a single transition matrix, supplemented by lattice-specific binary masks, gives all the thermodynamic quantities of interest for both ferro- and antiferromagnetic couplings. We apply the framework to all eleven Archimedean lattices, to all twenty 2-uniform lattices -- whose thermodynamics is obtained here for the first time -- and to several pentagonal lattices, and show that the same construction extends directly to fractal and disordered Ising models, with no modification to the underlying machinery.

cond-mat.stat-mech↗

Extreme First-Passage Time of Many Interacting Particles

Extreme first-passage events are broadly relevant to biological, chemical, and physical processes in which the first successful arrival determines the outcome. Existing theories are largely confined to noninteracting searchers. Interacting extreme-statistics problems are notoriously difficult because correlations destroy probability factorization. We establish a general framework for interacting extreme search. A no-go theorem shows that broad classes of short-range interactions cannot beat the $1/\ln N$ extreme timescale of $N$ independent Brownian searchers, and complementary upper bounds prove that this scale is exact for repulsive interactions. We then identify three sharp mechanisms beyond the logarithmic class and derive a unified interaction-driven acceleration limit. In particular, deterministic pairwise interaction can at most reduce the extreme search time to order $1/N$, while stochastic pairwise forcing attains $1/(N\ln N)$. Our results separate acceleration due to statistical redundancy from that generated by coherent many-body transport or amplified fluctuations, deepening our understanding of interacting many-body systems.

cond-mat.stat-mech↗