Search Results for ""

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

The metric properties discovered for a primitive figure remain applicable, without modifications other than changes of signs, to all correlative figures which can be ...

The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...

Let a knot K be parameterized by a vector function v(t) with t in S^1, and let w be a fixed unit vector in R^3. Count the number of local minima of the projection function ...

A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...

A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

A symbol used to distinguish a third quantity x^('') ("x double prime") from two other related quantities x and x^' ("x prime). Double primes are most commonly used to denote ...

For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...

Gödel's first incompleteness theorem states that all consistent axiomatic formulations of number theory which include Peano arithmetic include undecidable propositions ...