TOPICS
Search

Search Results for ""


2991 - 3000 of 3965 for Polynomial FunctionsSearch Results
A special nonsingular map from one manifold to another such that at every point in the domain of the map, the derivative is an injective linear transformation. This is ...
An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...
Let Q(x)=Q(x_1,x_2,...,x_n) be an integer-valued n-ary quadratic form, i.e., a polynomial with integer coefficients which satisfies Q(x)>0 for real x!=0. Then Q(x) can be ...
A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...
If A and B are commutative unit rings, and A is a subring of B, then A is called integrally closed in B if every element of B which is integral over A belongs to A; in other ...
An element admitting a multiplicative or additive inverse. In most cases, the choice between these two options is clear from the context, as, for example, in a monoid, where ...
The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...
If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...
For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...
The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...
1 ... 297|298|299|300|301|302|303 ... 397 Previous Next

...