Search Results for ""

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

A second-order partial differential equation, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called elliptic if the matrix Z=[A B; B C] (2) is positive ...

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

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...