Search Results for ""

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

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

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.

The base-60 notational system for representing real numbers. A base-60 number system was used by the Babylonians and is preserved in the modern measurement of time (hours, ...

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

Two figures are homothetic if they are related by a dilation (a dilation is also known as a homothecy). This means that the connectors of corresponding points are concurrent ...

A relationship between knot polynomials for links in different orientations (denoted below as L_+, L_0, and L_-). J. H. Conway was the first to realize that the Alexander ...