Search Results for ""
401 - 410 of 1595 for Knot polynomialSearch Results
A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...
For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...
The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...
There are several meanings of the word content in mathematics. The content of a polytope or other n-dimensional object is its generalized volume (i.e., its "hypervolume"). ...
The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...
The connected sum M_1#M_2 of n-manifolds M_1 and M_2 is formed by deleting the interiors of n-balls B_i^n in M_i^n and attaching the resulting punctured manifolds M_i-B^._i ...
An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...
A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...
A notation is a set of well-defined rules for representing quantities and operations with symbols.
An oriented link is a link for which each connected component has been given an orientation. As oriented links are equivalent, if there is an orientation preserving ...
...
View search results from all Wolfram sites (8579 matches)

