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. 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 -axis. [4]

  4. Path integral formulation - Wikipedia

    en.wikipedia.org/wiki/Path_integral_formulation

    In physics, it is a foundation for lattice gauge theory and quantum chromodynamics. [3] It has been called the "most powerful formula in physics", [4] with Stephen Wolfram also declaring it to be the "fundamental mathematical construct of modern quantum mechanics and quantum field theory". [5]

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

  7. Grassmann number - Wikipedia

    en.wikipedia.org/wiki/Grassmann_number

    In mathematical physics, a Grassmann number, named after Hermann Grassmann (also called an anticommuting number or supernumber), is an element of the exterior algebra of a complex vector space. [1] The special case of a 1-dimensional algebra is known as a dual number .

  8. Particle in a one-dimensional lattice - Wikipedia

    en.wikipedia.org/wiki/Particle_in_a_one...

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

  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.