Search Results for ""

A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.

Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The sum of the absolute squares of the spherical harmonics Y_l^m(theta,phi) over all values of m is sum_(m=-l)^l|Y_l^m(theta,phi)|^2=(2l+1)/(4pi). (1) The double sum over m ...

The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...

A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...