Search Results for ""

A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...

The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

In the above figure, the identical squares A, B, C appear different in width and height, because subdividing a space makes it appear larger. A different orientation can also ...

The square knot, also called the reef knot, is a composite knot of six crossings consisting of a knot sum of a trefoil knot and its mirror image (Rolfsen 1976, p. 220). The ...

A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...

The largest square dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, ... (OEIS A008833).

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...