Search Results for ""

A matrix whose entries are polynomials.

Let H be a Hilbert space and M a closed subspace of H. Corresponding to any vector x in H, there is a unique vector m_0 in M such that |x-m_0|<=|x-m| for all m in M. ...

A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...

An epicycloid with n=5 cusps, named after the buttercup genus Ranunculus (Madachy 1979). Its parametric equations are x = a[6cost-cos(6t)] (1) y = a[6sint-sin(6t)]. (2) Its ...

The reflexive closure of a binary relation R on a set X is the minimal reflexive relation R^' on X that contains R. Thus aR^'a for every element a of X and aR^'b for distinct ...

The reflexive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same reflexive closure as R. Thus aR^'b for any elements a and b of X, ...

S_n(z) = zj_n(z)=sqrt((piz)/2)J_(n+1/2)(z) (1) C_n(z) = -zn_n(z)=-sqrt((piz)/2)N_(n+1/2)(z), (2) where j_n(z) and n_n(z) are spherical Bessel functions of the first and ...

A three-dimensional coordinate system in which the axes satisfy the right-hand rule.

The partial differential equation u_t+45u^2u_x+15u_xu_(xx)+15uu_(xxx)+u_(xxxxx)=0.

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...