Search Results for ""

A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...

A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...

A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

Nonparametric estimation is a statistical method that allows the functional form of a fit to data to be obtained in the absence of any guidance or constraints from theory. As ...

The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...

Let u_(p) be a unit tangent vector of a regular surface M subset R^3. Then the normal curvature of M in the direction u_(p) is kappa(u_(p))=S(u_(p))·u_(p), (1) where S is the ...

According to many authors (e.g., Kelley 1955, p. 112; Joshi 1983, p. 162; Willard 1970, p. 99) a normal space is a topological space in which for any two disjoint closed sets ...

Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...