Search Results for ""

Let f:A->B be a map between sets A and B. Let Y subset= B. Then the preimage of Y under f is denoted by f^(-1)(Y), and is the set of all elements of A that map to elements in ...

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

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 reference triangle is a triangle relative to which trilinear coordinates, exact trilinear coordinates, derived triangle, or other objects are defined in triangle geometry ...

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...

A rotor is a convex figure that can be rotated inside a polygon (or polyhedron) while always touching every side (or face). The least area rotor in a square is the Reuleaux ...

Consider a second-order differential operator L^~u(x)=p_0(d^2u)/(dx^2)+p_1(du)/(dx)+p_2u, (1) where u=u(x) and p_i=p_i(x) are real functions of x on the region of interest ...

A semimagic square is a square that fails to be a magic square only because one or both of the main diagonal sums do not equal the magic constant (Kraitchik 1942, p. 143). ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...