Search Results for ""

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...

An involution of a set S is a permutation of S which does not contain any permutation cycles of length >2 (i.e., it consists exclusively of fixed points and transpositions). ...

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

The dilogarithm Li_2(z) is a special case of the polylogarithm Li_n(z) for n=2. Note that the notation Li_2(x) is unfortunately similar to that for the logarithmic integral ...

The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...