TOPICS
Search

Search Results for ""


581 - 590 of 1449 for Exponential polynomialSearch Results
An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...
A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...
If one root of the equation f(x)=0, which is irreducible over a field K, is also a root of the equation F(x)=0 in K, then all the roots of the irreducible equation f(x)=0 are ...
The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...
The Alexander invariant H_*(X^~) of a knot K is the homology of the infinite cyclic cover of the complement of K, considered as a module over Lambda, the ring of integral ...
The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...
Given a field F and an extension field K superset= F, an element alpha in K is called algebraic over F if it is a root of some nonzero polynomial with coefficients in F. ...
The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...
A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...
A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...
1 ... 56|57|58|59|60|61|62 ... 145 Previous Next

...