Search Results for ""

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

n-minex is defined as 10^(-n).

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

Given a unit circle, pick two points at random on its circumference, forming a chord. Without loss of generality, the first point can be taken as (1,0), and the second by ...

The ten-of-diamonds decahedron is a stereohedron and space-filling polyhedron on 8 vertices, 16 edges, and 10 faces (8 of which are non-equilateral triangles and two of which ...

The Archimedean duals in general have many stellations. The following table extracted from Webb gives a partial enumeration. In the table, E denotes counts of enantiomorphous ...

A topological space X such that for every closed subset C of X and every point x in X\C, there is a continuous function f:X->[0,1] such that f(x)=0 and f(C)={1}. This is the ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

Suppose f(x) is continuous at a stationary point x_0. 1. If f^'(x)>0 on an open interval extending left from x_0 and f^'(x)<0 on an open interval extending right from x_0, ...