Search Results for ""
1771 - 1780 of 9247 for Random Walk 2 DimensionalSearch Results
An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...
The geodesic on an oblate spheroid can be computed analytically, although the resulting expression is much more unwieldy than for a simple sphere. A spheroid with equatorial ...
The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...
The reciprocal of the arithmetic-geometric mean of 1 and sqrt(2), G = 2/piint_0^11/(sqrt(1-x^4))dx (1) = 2/piint_0^(pi/2)(dtheta)/(sqrt(1+sin^2theta)) (2) = L/pi (3) = ...
The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...
The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...
Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...
A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...
A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...
The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...
...
View search results from all Wolfram sites (477000 matches)

