Search Results for ""

Inscribe two triangles DeltaA_1B_1C_1 and DeltaA_2B_2C_2 in a reference triangle DeltaABC such that A = ∠AB_1C_1=∠AC_2B_2 (1) B = ∠BC_1A_1=∠BA_2C_2 (2) C = ∠CA_1B_1=∠CB_2A_2. ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...

A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...

A singular point of an algebraic curve is a point where the curve has "nasty" behavior such as a cusp or a point of self-intersection (when the underlying field K is taken as ...

There are two types of singular values, one in the context of elliptic integrals, and the other in linear algebra. For a square matrix A, the square roots of the eigenvalues ...

If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...

In general, a singularity is a point at which an equation, surface, etc., blows up or becomes degenerate. Singularities are often also called singular points. Singularities ...

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

The small cubicuboctahedron is the uniform polyhedron with Maeder index 13 (Maeder 1997), Wenninger index 69 (Wenninger 1989), Coxeter index 38 (Coxeter et al. 1954), and ...