Related papers: The crossing multiplier for solvable lattice model…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
Lattice models exhibit significant potential in investigating phase transitions, yet they encounter numerous computational challenges. To address these issues, this study introduces a Monte Carlo-based approach that transforms lattice…
A recently introduced model describing the folding of the triangular lattice is generalized allowing for defects in the lattice and written as an Ising model with nearest-neighbor and plaquette interactions on the honeycomb lattice. Its…
We classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in…
Normalizing flows attempt to model an arbitrary probability distribution through a set of invertible mappings. These transformations are required to achieve a tractable Jacobian determinant that can be used in high-dimensional scenarios.…
Based on the two-dimensional lattice fermion model, we discuss transitions between different pairing states. Each phase is labeled by an integer which is a topological invariant and characterized by vortices of the Bloch wavefunction. The…
Model explainability is crucial for human users to be able to interpret how a proposed classifier assigns labels to data based on its feature values. We study generalized linear models constructed using sets of feature value rules, which…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
In this paper it is shown that the one-dimensional configuration sums of the solvable lattice models of Andrews, Baxter and Forrester and the string functions associated with admissible representations of the affine Lie algebra A$_1^{(1)}$…
Most practical constructions of lattice codes with high coding gains are multilevel constructions where each level corresponds to an underlying code component. Construction D, Construction D$'$, and Forney's code formula are classical…
In a previous paper, we introduced reflection equations for interaction-round-a-face (IRF) models and used these to construct commuting double-row transfer matrices for solvable lattice spin models with fixed boundary conditions. In…
We introduce the notion of positive local combinatorial dividing-lines in model theory. We show these are equivalently characterized by indecomposable algebraically trivial Fraisse classes and by complete prime filter classes. We exhibit…
We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…
We construct a tessellation of AdS$_3$, by extending the equilateral triangulation of AdS$_2$ on the Poincar\'{e} disk based on the $(2,3,7)$ triangle group, suitable for studying strongly coupled phenomena and the AdS/CFT correspondence. A…
Some features of integrable lattice models are reviewed for the case of the six-vertex model. By the Bethe ansatz method we derive the free energy of the six-vertex model. Then, from the expression of the free energy we show analytically…
We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…
In the past decade, tremendous efforts have been made towards understanding fermionic symmetry protected topological (FSPT) phases in interacting systems. Nevertheless, for systems with continuum symmetry, e.g., electronic insulators, it is…
In contrast to what happens for ferromagnets, the lattice structure participates in a crucial way to determine existence and type of critical behaviour in antiferromagnetic systems. It is an interesting question to investigate how the…
We extend the planar Pfaffian formalism for the evaluation of the Ising partition function to lattices of high topological genus g. The 3D Ising model on a cubic lattice, where g is proportional to the number of sites, is discussed in…
Based on consideration of the system symmetry and its Hilbert space, we show that strongly interacting fermions in an optical lattice or superlattice can be generically described by a lattice resonance Hamiltonian. The latter can be mapped…