TOPICS
Search

Search Results for ""


1041 - 1050 of 1689 for Algebraic linkSearch Results
The elliptic hyperboloid is the generalization of the hyperboloid to three distinct semimajor axes. The elliptic hyperboloid of one sheet is a ruled surface and has Cartesian ...
A quadratic surface which has elliptical cross section. The elliptic paraboloid of height h, semimajor axis a, and semiminor axis b can be specified parametrically by x = ...
A surface of revolution which is generalization of the ring torus. It is produced by rotating an ellipse having horizontal semi-axis a, vertical semi-axis b, embedded in the ...
The amazing polynomial identity communicated by Euler in a letter to Goldbach on April 12, 1749 (incorrectly given as April 15, 1705--before Euler was born--in Conway and Guy ...
The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...
A place nu of a number field k is an isomorphism class of field maps k onto a dense subfield of a nondiscrete locally compact field k_nu. In the function field case, let F be ...
A fractional ideal is a generalization of an ideal in a ring R. Instead, a fractional ideal is contained in the number field F, but has the property that there is an element ...
The end of the last gap in the Lagrange spectrum, given by F=(2221564096+283748sqrt(462))/(491993569)=4.5278295661... (OEIS A118472). Real numbers greater than F are members ...
Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...
The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...
1 ... 102|103|104|105|106|107|108 ... 169 Previous Next

...