TOPICS
Search

Search Results for ""


961 - 970 of 1537 for Degree PolynomialSearch Results
The pentagonal hexecontahedron is the 60-faced dual polyhedron of the snub dodecahedron A_8 (Holden 1971, p. 55). It is Wenninger dual W_(18). A tetrahedron 10-compound, cube ...
For some authors (e.g., Bourbaki, 1964), the same as principal ideal domain. Most authors, however, do not require the ring to be an integral domain, and define a principal ...
The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...
A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...
An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...
The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...
The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...
A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...
1 ... 94|95|96|97|98|99|100 ... 154 Previous Next

...