Search Results for ""

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

The primes nearest to the nonnegative integers n=0, 1, 2, ..., assigning ties to the smaller prime, are 2, 2, 2, 3, 3, 5, 5, 7, 7, 7, 11, 11, 11, 13, ... (OEIS A051697). If ...

Let generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] (1) have p=q+1. Then the generalized hypergeometric function is said to ...

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

A real quantity having a value less than zero (<0) is said to be negative. Negative numbers are denoted with a minus sign preceding the corresponding positive number, i.e., ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative lightlike if it has zero (Lorentzian) norm and if its first ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative timelike if it has imaginary (Lorentzian) norm and if its first ...

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

The neighborhood complex N(G) of a locally finite graph G is defined as the abstract simplicial complex formed by the subsets of the neighborhoods of all vertices of G.

Let H be a complex Hilbert space, and define a nest as a set N of closed subspaces of H satisfying the conditions: 1. 0,H in N, 2. If N_1,N_2 in N, then either N_1 subset= ...