enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lattice path - Wikipedia

    en.wikipedia.org/wiki/Lattice_Path

    Lattice path of length 5 in ℤ 2 with S = { (2,0), (1,1), (0,-1) }.. In combinatorics, a lattice path L in the d-dimensional integer lattice ⁠ ⁠ of length k with steps in the set S, is a sequence of vectors ⁠,, …, ⁠ such that each consecutive difference lies in S. [1]

  3. Lindström–Gessel–Viennot lemma - Wikipedia

    en.wikipedia.org/wiki/Lindström–Gessel...

    An n-path from an n-tuple (,, …,) of vertices of G to an n-tuple (,, …,) of vertices of G will mean an n-tuple (,, …,) of paths in G, with each leading from to . This n -path will be called non-intersecting just in case the paths P i and P j have no two vertices in common (including endpoints) whenever i ≠ j {\displaystyle i\neq j} .

  4. Self-avoiding walk - Wikipedia

    en.wikipedia.org/wiki/Self-avoiding_walk

    In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a lattice (a lattice path) that does not visit the same point more than once. This is a special case of the graph theoretical notion of a path. A self-avoiding polygon (SAP) is a closed self-avoiding walk on a lattice. Very little is known rigorously about the self-avoiding ...

  5. Narayana number - Wikipedia

    en.wikipedia.org/wiki/Narayana_number

    For example, in the first path for ⁡ (,), the nodes 0 and 1 will have two children each; in the last (sixth) path, node 0 will have three children and node 1 will have one child. To construct a rooted tree from a lattice path and vice versa, we can employ an algorithm similar to the one mentioned the previous paragraph.

  6. Brillouin zone - Wikipedia

    en.wikipedia.org/wiki/Brillouin_zone

    The reciprocal lattices (dots) and corresponding first Brillouin zones of (a) square lattice and (b) hexagonal lattice. In mathematics and solid state physics, the first Brillouin zone (named after Léon Brillouin) is a uniquely defined primitive cell in reciprocal space.

  7. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    Although the original problem asks for integer lattice points in a circle, there is no reason not to consider other shapes, for example conics; indeed Dirichlet's divisor problem is the equivalent problem where the circle is replaced by the rectangular hyperbola. [3]

  8. Lattice QCD - Wikipedia

    en.wikipedia.org/wiki/Lattice_QCD

    In lattice perturbation theory the scattering matrix is expanded in powers of the lattice spacing, a. The results are used primarily to renormalize Lattice QCD Monte-Carlo calculations. In perturbative calculations both the operators of the action and the propagators are calculated on the lattice and expanded in powers of a.

  9. Born–Landé equation - Wikipedia

    en.wikipedia.org/wiki/Born–Landé_equation

    The Born–Landé equation is a means of calculating the lattice energy of a crystalline ionic compound. In 1918 [ 1 ] Max Born and Alfred Landé proposed that the lattice energy could be derived from the electrostatic potential of the ionic lattice and a repulsive potential energy term.