Related papers: Geometric Criterion for Solvability of Lattice Spi…
Motivated by the recent synthesis of two insulating Li$_2$IrO$_3$ polymorphs, where Ir$^{4+}$ $S_{eff}$=1/2 moments form 3D ("harmonic") honeycomb structures with threefold coordination, we study magnetic Hamiltonians on the resulting…
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
We study the scalar modes of linear perturbations in loop quantum cosmology. This is done on a lattice where each cell is taken to be homogeneous and isotropic and can be quantized via standard homogeneous loop quantum cosmology techniques.…
We present an exactly solvable spin-3/2 model defined on a pentacoordinated three-dimensional graphite lattice, which realizes a novel quantum spin liquid with second-order topology. The exact solutions are described by Majorana fermions…
The quantum simulation of topological phases in (2+1)D quantum electrodynamics with Wilson fermions provides a promising route toward realizing topological phenomena in near-term lattice experiments. We show that the commonly used…
We consider linear stability of steady states of 1(1/2) and 3D Vlasov-Maxwell systems for collisionless plasmas. The linearized systems can be written as separable Hamiltonian systems with constraints. By using a general theory for…
Topological gravity is the reduction of Einstein's theory to spacetimes with vanishing curvature, but with global degrees of freedom related to the topology of the universe. We present an exact Hamiltonian lattice theory for topological…
We study the dissipative dynamics of a class of interacting ``gamma-matrix'' spin models coupled to a Markovian environment. For spins on an arbitrary graph, we construct a Lindbladian that maps to a non-Hermitian model of free Majorana…
The harmonic Frenkel-Kontorova model is used to illustrate with an exactly solvable example a general technique of mapping a coherently strained epitaxial system with continuous atomic displacements onto a lattice gas model (LGM) with only…
We present a generic and systematic approach for constructing D-dimensional lattice models with exactly solvable d-dimensional boundary states localized to corners, edges, hinges and surfaces. These solvable models represent a class of…
We consider discrete one dimensional nonlinear equations and present the procedure of lifting them to Z-graded graphs. We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. In particular, we prove…
The "Hermitizability" problem of quantum theory is explained, discussed and illustrated via the discrete-lattice cryptohermitian quantum graphs. In detail, the description of the domain ${\cal D}$ of admissible parameters is provided for…
In this paper we present the theorem on Lie integrability by quadratures for time-independent Hamiltonian systems on symplectic and contact manifolds, and for time-dependent Hamiltonian systems on cosymplectic and cocontact manifolds. We…
We consider an one-dimensional lattice system of unbounded and continuous spins. The Hamiltonian consists of a perturbed strictly-convex single-site potential and with longe-range interaction. We show that if the interactions decay…
We consider some classical and frustrated lattice spin models with global O(3) spin symmetry. There is no general analytical method to find a ground-state if the spin dependence of the Hamiltonian is more than quadratic (i.e. beyond the…
A detailed study of an $S={1\over2}$ spin ladder model is given. The ladder consists of plaquettes formed by nearest neighbor rungs with all possible SU(2)-invariant interactions. For properly chosen coupling constants, the model is shown…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…
We present the Hamiltonian formulation of the recently constructed integrable theories of arXiv:2006.12525. These theories turn out to be canonically equivalent to the sum of an asymmetrically gauged CFT and of the most general…