Search Results for ""

A polyhedron is rigid if it cannot be continuously deformed into another configuration. A rigid polyhedron may have two or more stable forms which cannot be continuously ...

A circle having a given number of lattice points on its circumference. The Schinzel circle having n lattice points is given by the equation {(x-1/2)^2+y^2=1/45^(k-1) for n=2k ...

For every positive integer n, there exists a circle in the plane having exactly n lattice points on its circumference. The theorem is based on the number r(n) of integral ...

In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

Set theory is the mathematical theory of sets. Set theory is closely associated with the branch of mathematics known as logic. There are a number of different versions of set ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

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

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

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...