Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExactly solvable quantum spin tubes and ladders
152
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We find families of integrable n-leg spin-1/2 ladders and tubes with general isotropic exchange interactions between spins. These models are equivalent to su(N) spin chains with N=2^n. Arbitrary rung interactions in the spin tubes and ladders induce chemical potentials in the equivalent spin chains. The potentials are n-dependent and differ for the tube and ladder models. The models are solvable by means of nested Bethe Ansatz.
rate research
Read More
It is shown that solvable mixed spin ladder models can be constructed from su(N) permutators. Heisenberg rung interactions appear as chemical potential terms in the Bethe Ansatz solution. Explicit examples given are a mixed spin-1/2 spin-1 ladder, a mixed spin-1/2 spin-3/2 ladder and a spin-1 ladder with biquadratic interactions.
We construct and analyze a family of $M$-component vectorial spin systems which exhibit glass transitions and jamming within supercooled paramagnetic states without quenched disorder. Our system is defined on lattices with connectivity $c=alpha M$ and becomes exactly solvable in the limit of large number of components $M to infty$. We consider generic $p$-body interactions between the vectorial Ising/continuous spins with linear/non-linear potentials. The existence of self-generated randomness is demonstrated by showing that the random energy model is recovered from a $M$-component ferromagnetic $p$-spin Ising model in $M to infty$ and $p to infty$ limit. In our systems the quenched disorder, if present, and the self-generated disorder act additively. Our theory provides a unified mean-field theoretical framework for glass transitions of rotational degree of freedoms such as orientation of molecules in glass forming liquids, color angles in continuous coloring of graphs and vector spins of geometrically frustrated magnets. The rotational glass transitions accompany various types of replica symmetry breaking. In the case of repulsive hardcore interactions in the spin space, continuous the criticality of the jamming or SAT/UNSTAT transition becomes the same as that of hardspheres.
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special crossing symmetry. The crossing symmetry equates partition functions on different trivalent graphs, allowing a transformation to a graph where the partition function is easily computed. The simplest example is counting the number of nets without ends on the honeycomb lattice, including a weight per branching. Other examples include an Ising model on the Kagome lattice with three-spin interactions, dimers on any graph of corner-sharing triangles, and non-crossing loops on the honeycomb lattice, where multiple loops on each edge are allowed. We give several methods for obtaining models with this crossing symmetry, one utilizing discrete groups and another anyon fusion rules. We also present results indicating that for models which deviate slightly from having crossing symmetry, a real-space decimation (renormalization-group-like) procedure restores the crossing symmetry.
Tolls are collected on many highways as a means of traffic control and revenue generation. However, the presence of tollbooths on highway surely slows down traffic flow. Here, we investigate how the presence of tollbooths affect the average car speed using a simple-minded single lane deterministic discrete traffic model. More importantly, the model is exactly solvable.
Within the formalism of matrix product ansatz, we study a two-species asymmetric exclusion process with backward and forward site-ordered sequential update. This model, which was originally introduced with the random sequential update, describes a two-way traffic flow with a dynamic impurity and shows a phase transition between the free flow and traffic jam. We investigate the characteristics of this jamming and examine similarities and differences between our results and those with random sequential update.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
