Search Results for ""

An algebraic function is a function f(x) which satisfies p(x,f(x))=0, where p(x,y) is a polynomial in x and y with integer coefficients. Functions that can be constructed ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

Because even high-resolution computer monitors have a relatively small number of pixels, when graphics or text display distinguish between individual pixels. The result is ...

A square matrix A is antihermitian if it satisfies A^(H)=-A, (1) where A^(H) is the adjoint. For example, the matrix [i 1+i 2i; -1+i 5i 3; 2i -3 0] (2) is an antihermitian ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

The associated Legendre polynomials P_l^m(x) and P_l^(-m)(x) generalize the Legendre polynomials P_l(x) and are solutions to the associated Legendre differential equation, ...

Given a principal bundle pi:A->M, with fiber a Lie group G and base manifold M, and a group representation of G, say phi:G×V->V, then the associated vector bundle is ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

The Benney equation in 1+1 dimensions is the nonlinear partial differential equation ...

In order to find a root of a polynomial equation a_0x^n+a_1x^(n-1)+...+a_n=0, (1) consider the difference equation a_0y(t+n)+a_1y(t+n-1)+...+a_ny(t)=0, (2) which is known to ...