Search Results for ""

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

The set of fixed points which do not move as a knot is transformed into itself is not a knot. The conjecture was proved in 1978 (Morgan and Bass 1984). According to Morgan ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

A stable isolated (i.e., solitary) traveling nonlinear wave solution to a set of equations that obeys a superposition-like principle (i.e., solitons passing through one ...

A piecewise polynomial function that can have a locally very simple form, yet at the same time be globally flexible and smooth. Splines are very useful for modeling arbitrary ...

A short exact sequence of groups 0-->A-->B-->C-->0 (1) is called split if it essentially presents B as the direct sum of the groups A and C. More precisely, one can construct ...

A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...

The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...

For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...