Search Results for ""

The complete elliptic integral of the second kind, illustrated above as a function of k, is defined by E(k) = E(1/2pi,k) (1) = ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

The complex plane is the plane of complex numbers spanned by the vectors 1 and i, where i is the imaginary number. Every complex number corresponds to a unique point in the ...

The constant a_(-1) in the Laurent series f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n (1) of f(z) about a point z_0 is called the residue of f(z). If f is analytic at z_0, its ...

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

A strongly regular graph with parameters (n,k,a,c) has graph eigenvalues k, theta, and tau, where theta = ((a-c)+sqrt(Delta))/2 (1) tau = ((a-c)-sqrt(Delta))/2 (2) where ...