Search Results for ""

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

A metatheorem in mathematical logic also known under the name "conditional proof." It states that if the sentential formula B can be derived from the set of sentential ...

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...

Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...

A subspace A of X is called a deformation retract of X if there is a homotopy F:X×I->X (called a retract) such that for all x in X and a in A, 1. F(x,0)=x, 2. F(x,1) in A, ...

A limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class. For example, the point is a degenerate case of the circle as ...

Degen's eight-square identity is the incredible polynomial identity (1) found around 1818 by the Danish mathematician Ferdinand Degen (1766-1825). It was subsequently ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

The word "degree" has many meanings in mathematics. The most common meaning is the unit of angle measure defined such that an entire rotation is 360 degrees. This unit harks ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...