Search Results for ""

A function f(x) is said to be nondecreasing on an interval I if f(b)>=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nonincreasing on an interval ...

A *-algebra A of operators on a Hilbert space H is said to act nondegenerately if whenever Txi=0 for all T in A, it necessarily implies that xi=0. Algebras A which act ...

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 nonempty set is a set containing one or more elements. Any set other than the empty set emptyset is therefore a nonempty set. Nonempty sets are sometimes also called ...

If A=>!B and B=>!A (i.e., (A=>!B) ^ (B=>!A), where !A denotes NOT, => denotes implies, and ^ denotes AND), then A and B are said to be inequivalent, a relationship which 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 ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

An algebraic surface of degree 9. Enneper's minimal surface is an example of a nonic surface.