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. Narayana number - Wikipedia

    en.wikipedia.org/wiki/Narayana_number

    The Narayana numbers also count the number of lattice paths from (,) to (,), with steps only northeast and southeast, not straying below the x-axis, with ⁠ ⁠ peaks. The following figures represent the Narayana numbers N ⁡ ( 4 , k ) {\displaystyle \operatorname {N} (4,k)} , illustrating the above mentioned symmetries.

  4. Map of lattices - Wikipedia

    en.wikipedia.org/wiki/Map_of_lattices

    A totally ordered set is a distributive lattice. 21. A metric lattice is modular. [6] 22. A modular lattice is semi-modular. [7] 23. A projective lattice is modular. [8] 24. A projective lattice is geometric. (def) 25. A geometric lattice is semi-modular. [9] 26. A semi-modular lattice is atomic. [10] [disputed – discuss] 27. An atomic ...

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

  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. Delannoy number - Wikipedia

    en.wikipedia.org/wiki/Delannoy_number

    The Delannoy number (,) also counts the global alignments of two sequences of lengths and , [2] the points in an m-dimensional integer lattice or cross polytope which are at most n steps from the origin, [3] and, in cellular automata, the cells in an m-dimensional von Neumann neighborhood of radius n.

  8. Fractional coordinates - Wikipedia

    en.wikipedia.org/wiki/Fractional_coordinates

    A lattice in which the conventional basis is primitive is called a primitive lattice, while a lattice with a non-primitive conventional basis is called a centered lattice. The choice of an origin and a basis implies the choice of a unit cell which can further be used to describe a crystal pattern.

  9. Hexagonal lattice - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_lattice

    The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. [1] The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset hexagonal lattices. In nature, carbon atoms of the two-dimensional material graphene are arranged in a honeycomb ...