Search Results for ""

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...

The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...