Search Results for ""

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...

The north pole is the point on a sphere with maximum z-coordinate for a given coordinate system. For a rotating sphere like the Earth, the natural coordinate system is ...

The south pole is the point on a sphere with minimum z-coordinate for a given coordinate system. For a rotating sphere like the Earth, the natural coordinate system is ...

Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...