Search Results for ""

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 ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...