Search Results for ""

A square which is magic under multiplication instead of addition (the operation used to define a conventional magic square) is called a multiplication magic square. Unlike ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

If isosceles triangles with apex angles 2kpi/n are erected on the sides of an arbitrary n-gon A_0, and if this process is repeated with the n-gon A_1 formed by the free ...

Three-dimensional generalization of the polyominoes to n dimensions. The number of polycubes N(n) composed of n cubes are 1, 1, 2, 8, 29, 166, 1023, ... (OEIS A000162; Ball ...

An algebraic surface of surface order 4. Unlike cubic surfaces, quartic surfaces have not been fully classified. Examples of quartic surfaces include the apple surface, ...

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...

The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...

A correction which must be applied to the measured moments m_k obtained from normally distributed data which have been binned in order to obtain correct estimators mu^^_i for ...

The randomization of a deck of cards by repeated interleaving. More generally, a shuffle is a rearrangement of the elements in an ordered list. Shuffling by exactly ...