Search Results for ""

The tangential mid-arc triangle of a reference triangle DeltaABC is the triangle DeltaA^'B^'C^' whose sides are the tangents to the incircle at the intersections of the ...

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

Flat polygons embedded in three-space can be transformed into a congruent planar polygon as follows. First, translate the starting vertex to (0, 0, 0) by subtracting it from ...

The alternating harmonic series is the series sum_(k=1)^infty((-1)^(k-1))/k=ln2, which is the special case eta(1) of the Dirichlet eta function eta(z) and also the x=1 case ...

The Elsasser function is defined by the integral E(y,u)=int_(-1/2)^(1/2)exp[-(2piyusinh(2piy))/(cosh(2piy)-cos(2pix))]dx. (1) Special values include E(0,u) = 1 (2) E(y,0) = ...

A spheroidal harmonic is a special case of an ellipsoidal harmonic that satisfies the differential equation d/(dx)[(1-x^2)(dS)/(dx)]+(lambda-c^2x^2-(m^2)/(1-x^2))S=0 on the ...

Let A=a_(ij) be a matrix with positive coefficients and lambda_0 be the positive eigenvalue in the Frobenius theorem, then the n-1 eigenvalues lambda_j!=lambda_0 satisfy the ...

If all elements a_(ij) of an irreducible matrix A are nonnegative, then R=minM_lambda is an eigenvalue of A and all the eigenvalues of A lie on the disk |z|<=R, where, if ...