Search Results for ""
141 - 150 of 622 for Quadratic InvariantSearch Results
![](/common/images/search/spacer.gif)
An elliptic curve is the set of solutions to an equation of the form y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6. (1) By changing variables, y->2y+a_1x+a_3, assuming the field ...
An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...
The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...
A point x^* which is mapped to itself under a map G, so that x^*=G(x^*). Such points are sometimes also called invariant points or fixed elements (Woods 1961). Stable fixed ...
A hypersphere S^n is parallelizable if there are n vector fields that are linearly independent at each point. There exist only three parallelizable spheres: S^1, S^3, and S^7 ...
Two knots are pass equivalent if there exists a sequence of pass moves taking one to the other. Every knot is either pass equivalent to the unknot or trefoil knot. These two ...
Let K be a number field with r_1 real embeddings and 2r_2 imaginary embeddings and let r=r_1+r_2-1. Then the multiplicative group of units U_K of K has the form ...
The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...
The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...
A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...
![](/common/images/search/spacer.gif)
...