Search Results for ""

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

An algebraic equation in n variables is an polynomial equation of the form f(x_1,x_2,...,x_n)=sum_(e_1,...,e_n)c_(e_1,e_2,...,e_n)x_1^(e_1)x_2^(e_2)...x_n^(e_n)=0, where the ...

A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...

The bicorn, sometimes also called the "cocked hat curve" (Cundy and Rollett 1989, p. 72), is the name of a collection of quartic curves studied by Sylvester in 1864 and ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

A block matrix is a matrix that is defined using smaller matrices, called blocks. For example, [A B; C D], (1) where A, B, C, and D are themselves matrices, is a block ...

The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...

A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...