Search Results for ""

The central point (r=0) in polar coordinates, or the point with all zero coordinates (0, ..., 0) in Cartesian coordinates. In three dimensions, the x-axis, y-axis, and z-axis ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...

A quadratic form Q(x) is indefinite if it is less than 0 for some values and greater than 0 for others. The quadratic form, written in the form (x,Ax), is indefinite if ...

Given a smooth function f:R^n->R^n, if the Jacobian is invertible at 0, then there is a neighborhood U containing 0 such that f:U->f(U) is a diffeomorphism. That is, there is ...

A zero vector, denoted 0, is a vector of length 0, and thus has all components equal to zero. It is the additive identity of the additive group of vectors.

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...