Search Results for ""

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A New Kind of Science is a seminal work on simple programs by Stephen Wolfram. In 1980, Wolfram's studies found unexpected behavior in a collection of simple computer ...

A nexus number is a figurate number built up of the nexus of cells less than n steps away from a given cell. The nth d-dimensional nexus number is given by N_d(n) = ...

Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...

An error which is superimposed on top of a true signal. Noise may be random or systematic. Noise can be greatly reduced by transmitting signals digitally instead of in analog ...

Let K be a field of arbitrary characteristic. Let v:K->R union {infty} be defined by the following properties: 1. v(x)=infty<=>x=0, 2. v(xy)=v(x)+v(y) forall x,y in K, and 3. ...

A sequence of positive integers 1<=a_1<a_2<a_3<... (1) is a nonaveraging sequence if it contains no three terms which are in an arithmetic progression, i.e., terms such that ...

A surface such as the Möbius strip or Klein bottle (Gray 1997, pp. 322-323) on which there exists a closed path such that the directrix is reversed when moved around this ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...