Search results
Results from the WOW.Com Content Network
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 ...
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 ...
In computer graphics, free-form deformation (FFD) is a geometric technique used to model simple deformations of rigid objects. It is based on the idea of enclosing an object within a cube or another hull object, and transforming the object within the hull as the hull is deformed.
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 ...
For example, if a is some element of X, then a ∨ 1 = 1 and a ∧ 1 =a. The word problem for free bounded lattices is the problem of determining which of these elements of W(X) denote the same element in the free bounded lattice FX, and hence in every bounded lattice. The word problem may be resolved as follows.
However, to date, no three-dimensional (3D) problem has had a solution that is both complete and exact. [4] Over the last ten years, Aranovich and Donohue have developed lattice density functional theory (LDFT) based on a generalization of the Ono-Kondo equations to three-dimensions, and used the theory to model a variety of physical phenomena.
A common type of lattice graph (known under different names, such as grid graph or square grid graph) is the graph whose vertices correspond to the points in the plane with integer coordinates, x-coordinates being in the range 1, ..., n, y-coordinates being in the range 1, ..., m, and two vertices being connected by an edge whenever the corresponding points are at distance 1.
In condensed matter physics, the Su–Schrieffer–Heeger (SSH) model or SSH chain is a one-dimensional lattice model that presents topological features. [1] It was devised by Wu-Pei Su, John Robert Schrieffer, and Alan J. Heeger in 1979, to describe the increase of electrical conductivity of polyacetylene polymer chain when doped, based on the existence of solitonic defects.