Search results
Results from the WOW.Com Content Network
In some cases, the Schrödinger equation can be solved analytically on a one-dimensional lattice of finite length [6] [7] using the theory of periodic differential equations. [8] The length of the lattice is assumed to be L = N a {\displaystyle L=Na} , where a {\displaystyle a} is the potential period and the number of periods N {\displaystyle ...
Transfer-matrix methods have been critical for many exact solutions of problems in statistical mechanics, including the Zimm–Bragg and Lifson–Roig models of the helix-coil transition, transfer matrix models for protein-DNA binding, as well as the famous exact solution of the two-dimensional Ising model by Lars Onsager.
This form is universal (at least for non-nested systems), with the momentum and scattering functions being model-dependent. The Yang–Baxter equation guarantees consistency of the construction. The Pauli exclusion principle is valid for models solvable by the Bethe ansatz, even for models of interacting bosons. The ground state is a Fermi sphere.
In 1925, Ising [2] gave an exact solution to the one-dimensional (1D) lattice problem. In 1944 Onsager [3] was able to get an exact solution to a two-dimensional (2D) lattice problem at the critical density. However, to date, no three-dimensional (3D) problem has had a solution that is both complete and exact. [4]
The main problem of quantum many-body physics is the fact that the Hilbert space grows exponentially with size. In other words if one considers a lattice, with some Hilbert space of dimension on each site of the lattice, then the total Hilbert space would have dimension , where is the number of sites on the lattice.
This is shown in Fig 1 for a 1D lattice as an example. Atomistic scale modeling is needed to calculate this distortion near the defect, [13] [14] whereas the continuum model is used to calculate the distortion far away from the defect. The MSGF links these two scales seamlessly. Fig. 1 – A one-dimensional lattice with full translational symmetry.
A lattice in the sense of a 3-dimensional array of regularly spaced points coinciding with e.g. the atom or molecule positions in a crystal, or more generally, the orbit of a group action under translational symmetry, is a translation of the translation lattice: a coset, which need not contain the origin, and therefore need not be a lattice in ...
In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices.The conjectured intractability of such problems is central to the construction of secure lattice-based cryptosystems: lattice problems are an example of NP-hard problems which have been shown to be average-case hard, providing a test case for the security of cryptographic ...