Searcharxiv⌕ Search

arXiv subjects

Ryan Flynn

Publications and source records attributed to Ryan Flynn.

7 recordsLinked to original sources
arXiv2026

SU(N) Quantum Spin Model with Weak and Strong First-Order Néel to Valence-Bond Solid Transitions

We introduce an SU($N$) symmetric two-dimensional quantum spin model, the X-Q model, which hosts a ground state transition between Néel antiferromagnetic and spontaneously dimerized states. The Q terms are products of two adjacent singlet projectors on first-neighbor sites, as in the often studied J-Q model (where J is the Heisenberg exchange), while the X terms are products of two permutation operators on second-neighbor sites. Quantum Monte Carlo simulations reveal close proximity to a deconfined quantum critical point for $N=2$, as in the J-Q model. However, for $N>2$ the transformation becomes strongly first order, contrary to conventional expectations that increasing $N$ should weaken discontinuities. We attribute this behavior to the inability of the X term, which dominates at the transition for large $N$, to induce significant U(1) fluctuations of the dimer pattern. These results provide insights into the microscopic interactions that support deconfined criticality.

cond-mat.str-el↗
arXiv2026

Imaginary-time correlations in time-sliced stochastic series expansion

Combined with numerical analytic continuation techniques, quantum Monte Carlo (QMC) methods enable the extraction of real-frequency dynamical properties from imaginary-time correlation functions. However, the efficient computation of imaginary-time correlation functions by QMC simulations can (depending on the particular model used) be challenging, particularly for operators that are off-diagonal in the computational basis. In this work, we present an efficient and general algorithm within the stochastic series expansion (SSE) framework for evaluating imaginary-time correlation functions of both diagonal and off-diagonal operators. The algorithm builds on a discrete imaginary-time slicing of the SSE operator string, which provides correlation functions on a grid of well-defined imaginary-time points with no discretization error. For off-diagonal operators, we derive estimators that integrate directly into the existing SSE directed-loop or cluster updating schemes, introducing only minimal computational overhead. We benchmark the method on the one-dimensional transverse-field Ising model (sampling with cluster updates) and XXZ spin chain (using directed-loop sampling), demonstrating excellent agreement (with only statistical errors) with exact diagonalization of small systems. We also study larger systems to demonstrate efficiency.

cond-mat.str-el↗
arXiv2026

Moiré magnetism in a bilayer Ising model

Moiré patterns in magnetic bilayers generate spatially modulated interlayer exchange interactions that can give rise to nonuniform magnetic textures. We study a minimal classical bilayer Ising model with a moiré-modulated interlayer coupling, generated either by relative twist or differential strain between the layers. Using large-scale classical Monte Carlo simulations, we show that the ordering transition remains in the conventional two-dimensional Ising universality class, even when the low-temperature state is domain-textured. At low temperatures, we find a smooth crossover between a uniform ferromagnet and domain-textured state, in which the spins locally follow the sign of the interlayer exchange. We demonstrate that there is no breaking of layer symmetry for twisted bilayers. The location of the crossover is determined by a simple geometric energy balance between bulk interlayer exchange and intralayer domain-wall costs. Our results provide a minimal framework for understanding how moiré-modulated magnetic textures can emerge from geometric energetics without requiring a thermodynamic phase transition.

cond-mat.stat-mech↗
arXiv2011

Graph components and dynamics over finite fields

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical systems.

math.DS↗
arXiv2008

Sorting a Permutation by block moves

We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.

math.CO↗
arXiv2006

Permutations Containing Many Patterns

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

math.CO↗