Search Results for ""

A q-analog of Zeilberger's algorithm.

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

In the usual diagram of inclusion homomorphisms, if the upper two maps are injective, then so are the other two. More formally, consider a space X which is expressible as the ...

Divide a triangle by its three medians into six smaller triangles. Surprisingly, the circumcenters O_(AB), O_(BA), etc. of the six circumcircles of these smaller triangles ...

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the ...

Van der Corput's constant is given by m = 2sqrt(2)int_0^(sqrt(pi/2-c))cos(x^2+c)dx (1) = 2pi[coscC(phi)-sincS(phi)] (2) = 3.3643175781... (3) (OEIS A143305), where C(x) and ...

The van der Grinten projection is a map projection given by the transformation x = (1) y = sgn(phi)(pi|PQ-Asqrt((A^2+1)(P^2+A^2)-Q^2)|)/(P^2+A^2), (2) where A = ...

The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting y=y^'. It is an ...

A von Neumann regular ring is a ring R such that for all a in R, there exists a b in R satisfying a=aba (Jacobson 1989, p. 196). More formally, a ring R is regular in the ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...