Search Results for ""

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...

Given a first-order ordinary differential equation (dy)/(dx)=F(x,y), (1) if F(x,y) can be expressed using separation of variables as F(x,y)=X(x)Y(y), (2) then the equation ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

The product C of two matrices A and B is defined as c_(ik)=a_(ij)b_(jk), (1) where j is summed over for all possible values of i and k and the notation above uses the ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

A quotient-difference table is a triangular array of numbers constructed by drawing a sequence of n numbers in a horizontal row and placing a 1 above each. An additional "1" ...