Search Results for ""

Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

A procedure for determining the behavior of an nth order ordinary differential equation at a removable singularity without actually solving the equation. Consider ...

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

The Legendre differential equation is the second-order ordinary differential equation (1-x^2)(d^2y)/(dx^2)-2x(dy)/(dx)+l(l+1)y=0, (1) which can be rewritten ...

The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...