Search Results for ""
601 - 610 of 937 for Cantor Diagonal MethodSearch Results
Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...
The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...
A square matrix is called Hermitian if it is self-adjoint. Therefore, a Hermitian matrix A=(a_(ij)) is defined as one for which A=A^(H), (1) where A^(H) denotes the conjugate ...
If two points A and A^' are inverse with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to the line of the points AA^' ...
Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...
The Lorenz curve is used in economics and ecology to describe inequality in wealth or size. The Lorenz curve is a function of the cumulative proportion of ordered individuals ...
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 trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...
The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...
Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...
...
View search results from all Wolfram sites (19017 matches)

