Search Results for ""

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

A map projection. The inverse equations for phi are computed by iteration. Let the angle of the projection plane be theta_b. Define a={0 for theta_b=1/2pi; ...

An expression is said to be ambiguous (or poorly defined) if its definition does not assign it a unique interpretation or value. An expression which is not ambiguous is said ...

An asymmetric matrix is a square matrix that is not symmetric, i.e., a matrix A such that A^(T)!=A, where A^(T) denotes the transpose. An asymmetric matrix therefore ...

The system of partial differential equations u_t+u_x = v^2-u^2 (1) v_t-v_x = u^2-v^2. (2)

The number of coincidences of a (nu,nu^') correspondence of value gamma on a curve of curve genus p is given by nu+nu^'+2pgamma.

The average of the values of the class limits for a given class. A class mark is also called a midvalue or central value (Kenney and Keeping 1962, p. 14), and is commonly ...

The comass of a differential p-form phi is the largest value of phi on a p vector of p-volume one, sup_(v in ^ ^pTM,|v|=1)|phi(v)|.