Search Results for ""

In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...

Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

A Gaussian quadrature-like formula for numerical estimation of integrals. It requires m+1 points and fits all polynomials to degree 2m, so it effectively fits exactly all ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

Consider a unit circle and a radiant point located at (mu,0). There are four different regimes of caustics, illustrated above. For radiant point at mu=infty, the catacaustic ...

The orthogonal polynomials on the interval [-1,1] associated with the weighting functions w(x) = (1-x^2)^(-1/2) (1) w(x) = (1-x^2)^(1/2) (2) w(x) = sqrt((1-x)/(1+x)), (3) ...

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

A random number generator produced by iterating X_(n+1)=|100lnX_n (mod 1)| for a seed X_0=0.1. This simple generator passes the noise sphere test for randomness by showing no ...

Let gamma(t) be a smooth curve in a manifold M from x to y with gamma(0)=x and gamma(1)=y. Then gamma^'(t) in T_(gamma(t)), where T_x is the tangent space of M at x. The ...