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. Laue equations - Wikipedia

    en.wikipedia.org/wiki/Laue_equations

    Laue equation. In crystallography and solid state physics, the Laue equations relate incoming waves to outgoing waves in the process of elastic scattering, where the photon energy or light temporal frequency does not change upon scattering by a crystal lattice. They are named after physicist Max von Laue (1879–1960).

  4. 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} .

  5. 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 ...

  6. 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.

  7. Schröder number - Wikipedia

    en.wikipedia.org/wiki/Schröder_number

    The (large) Schröder numbers count both types of paths, and the little Schröder numbers count only the paths that only touch the diagonal but have no movements along it. [ 3 ] Just as there are (large) Schröder paths, a little Schröder path is a Schröder path that has no horizontal steps on the x {\displaystyle x} -axis.

  8. Feynman diagram - Wikipedia

    en.wikipedia.org/wiki/Feynman_diagram

    The graphs determine the local equations of motion, while the allowed large-scale configurations describe non-perturbative physics. But because Feynman propagators are nonlocal in time, translating a field process to a coherent particle language is not completely intuitive, and has only been explicitly worked out in certain special cases.

  9. 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.