Related papers: Geometric Criterion for Solvability of Lattice Spi…
This note gives a general construction of an integrable lattice model (and a solution of the Yang-Baxter equation with spectral parameter) from a four-dimensional field theory which is a mixture of topological and holomorphic. Spin-chain…
Symmetry is a guiding principle in physics that allows to generalize conclusions between many physical systems. In the ongoing search for new topological phases of matter, symmetry plays a crucial role because it protects topological…
Exactly solvable Hamiltonians with spin liquid ground states have proven to be extremely useful, not only because they unambiguously demonstrate that these phases can arise in systems of interacting spins but also as a pedagogical…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Higher symmetries can emerge at low energies in a topologically ordered state with no symmetry, when some topological excitations have very high energy scales while other topological excitations have low energies. The low energy properties…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…
In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…
We formulate a model of relativistic fermions moving in two Euclidean dimensions based on a tight-binding model of graphene. The eigenvalue spectrum of the resulting Dirac operator is solved numerically in smooth U(1) gauge field…
We introduce a family of SO($n$)-symmetric spin chains which generalize the transverse-field Ising chain for $n=1$. These spin chains are defined with Gamma matrices and can be exactly solved by mapping to $n$ species of itinerant Majorana…
Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…
It is shown that the 3-body trigonometric G_2 integrable system is exactly-solvable. If the configuration space is parametrized by certain symmetric functions of the coordinates then, for arbitrary values of the coupling constants, the…
We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…
It is known that certain theories with extended supersymmetry can be discretized in such a way as to preserve an exact fermionic symmetry. In the simplest model of this kind, we show that this residual supersymmetric invariance is actually…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
This paper is the third of a series on Hamiltonian stationary Lagrangian surfaces. We present here the most general theory, valid for any Hermitian symmetric target space. Using well-chosen moving frame formalism, we show that the equations…
We investigate (2+1)-d Hamiltonian lattice gauge theory using a class of Hamiltonians having exactly known vacuum states. These theories are shown to have a wide range of possible classical continuum limits which differ from that of the…
Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
A Hamiltonian formulation of generic many-body systems with balanced loss and gain is presented. It is shown that a Hamiltonian formulation is possible only if the balancing of loss and gain terms occur in a pairwise fashion. It is also…