Search Results for ""

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...

A quotient of two polynomials P(z) and Q(z), R(z)=(P(z))/(Q(z)), is called a rational function, or sometimes a rational polynomial function. More generally, if P and Q are ...

R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...

Resolution is a widely used word with many different meanings. It can refer to resolution of equations, resolution of singularities (in algebraic geometry), resolution of ...

The rhombicosahedron is the uniform polyhedron with Maeder index 56 (Maeder 1997), Wenninger index 96 (Wenninger 1989), Coxeter index 72 (Coxeter et al. 1954), and Har'El ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

The operator of fractional integration is defined as _aD_t^(-nu)f(t)=1/(Gamma(nu))int_a^tf(u)(t-u)^(nu-1)du for nu>0 with _aD_t^0f(t)=f(t) (Oldham and Spanier 1974, Miller ...

The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom !(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes ...

Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...

Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...