Search Results for ""

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.

The regulator of a number field K is a positive number associated with K. The regulator of an imaginary quadratic field is 1 and that of a real quadratic, imaginary cubic, or ...

Two links can be continuously deformed into each other iff any diagram of one can be transformed into a diagram of the other by a sequence of Reidemeister moves.

Rényi entropy is defined as: H_alpha(p_1,p_2,...,p_n)=1/(1-alpha)ln(sum_(i=1)^np_i^alpha), where alpha>0, alpha!=1. As alpha->1, H_alpha(p_1,p_2,...,p_n) converges to ...

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

An algorithm for computing an Egyptian fraction.

If the knot K is the boundary K=f(S^1) of a singular disk f:D->S^3 which has the property that each self-intersecting component is an arc A subset f(D^2) for which f^(-1)(A) ...

If the Taniyama-Shimura conjecture holds for all semistable elliptic curves, then Fermat's last theorem is true. Before its proof by Ribet in 1986, the theorem had been ...