Search Results for ""
91 - 100 of 250 for decompositionSearch Results
A mathematical object is said to be symmetric if it is invariant ("looks the same") under a symmetry transformation. A function, matrix, etc., is symmetric if it remains ...
A knot equivalent to a polygonal knot. Knots which are not tame are called wild knots.
An inscribed angle in a semicircle is a right angle.
Also called indiscrete topology, the trivial topology is the smallest topology on a set X, namely the one in which the only open sets are the empty set and the entire set X. ...
A quantity which takes on the value zero is said to vanish identically, or sometimes simply to vanish. The term "vanish identically" is preferred when emphasis is needed that ...
A method for constructing magic squares of odd order, also called the Siamese method.
Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...
An n×n-matrix A is said to be diagonalizable if it can be written on the form A=PDP^(-1), where D is a diagonal n×n matrix with the eigenvalues of A as its entries and P is a ...
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. ...
A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...
...
View search results from all Wolfram sites (1633 matches)

