Search Results for ""

Let F,G:C->D be functors between categories C and D. A natural transformation Phi from F to G consists of a family Phi_C:F(C)->G(C) of morphisms in D which are indexed by the ...

The equation of incompressible fluid flow, (partialu)/(partialt)+u·del u=-(del P)/rho+nudel ^2u, where nu is the kinematic viscosity, u is the velocity of the fluid parcel, P ...

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 ...

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 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.

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...