Search Results for ""

The ratio X_1/X_2 of uniform variates X_1 and X_2 on the interval [0,1] can be found directly as P_(X_1/X_2)(u) = int_0^1int_0^1delta((x_1)/(x_2)-u)dx_1dx_2 (1) = ...

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

Given a succession of nonsingular points which are on a nonhyperelliptic curve of curve genus p, but are not a group of the canonical series, the number of groups of the ...

The constant polynomial P(x)=0 whose coefficients are all equal to 0. The corresponding polynomial function is the constant function with value 0, also called the zero map. ...

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

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...