Search Results for ""

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

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

An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.

An expression built up from statements letters by appropriate application of connectives (Mendelson 1997, p. 13).

If a sequence has the property that the block growth function B(n)=n+1 for all n, then it is said to have minimal block growth, and the sequence is called a Sturmian ...

The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...

A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...

Trigonometric functions of pi/p for p prime have an especially complicated Galois-minimal representation. In particular, the case cos(pi/23) requires approximately 500 MB of ...

The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...