Search Results for ""

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 ...

A curve named after James Watt (1736-1819), the Scottish engineer who developed the steam engine (MacTutor Archive). The curve is produced by a linkage of rods connecting two ...

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...

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 ...

The Weierstrass constant is defined as the value sigma(1|1,i)/2, where sigma(z|omega_1,omega_2) is the Weierstrass sigma function with half-periods omega_1 and omega_2. ...