Search Results for ""

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

The matrix product of a square set of data d and a matrix of basis vectors consisting of Walsh functions. By taking advantage of the nested structure of the natural ordering ...

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

For a given point lattice, some number of points will be within distance d of the origin. A Waterman polyhedron is the convex hull of these points. A progression of Waterman ...

Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...

The Weibull distribution is given by P(x) = alphabeta^(-alpha)x^(alpha-1)e^(-(x/beta)^alpha) (1) D(x) = 1-e^(-(x/beta)^alpha) (2) for x in [0,infty), and is implemented in ...

An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...

The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

A single axiom that is satisfied only by NAND or NOR must be of the form "something equals a," since otherwise constant functions would satisfy the equation. With up to six ...