TOPICS
Search

Search Results for ""


61 - 70 of 462 for chain linkSearch Results
In a chain complex of modules ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->..., the module B_i of i-boundaries is the image of d_(i+1). It is a submodule of C_i and is ...
A module M is Noetherian if it obeys the ascending chain condition with respect to inclusion, i.e., if every set of increasing sequences of submodules eventually becomes ...
A single component algebraic link. Most knots up to 11 crossings are algebraic, but they quickly become outnumbered by nonalgebraic knots for more crossings (Hoste et al. ...
Construct a chain C of 2n components in a solid torus V. Now thicken each component of C slightly to form a chain C_1 of 2n solid tori in V, where pi_1(V-C_1)=pi_1(V-C) via ...
A link invariant defined for a two-component oriented link as the sum of +1 crossings and -1 crossing over all crossings between the two links divided by 2. For components ...
A ring is called left (respectively, right) Noetherian if it does not contain an infinite ascending chain of left (respectively, right) ideals. In this case, the ring in ...
Let K be a finite complex, and let phi:C_p(K)->C_p(K) be a chain map, then sum_(p)(-1)^pTr(phi,C_p(K))=sum_(p)(-1)^pTr(phi_*,H_p(K)/T_p(K)).
The natural domain of a function is the maximal chain of domains on which it can be analytically continued to a single-valued function.
A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...
A projection of a link is tricolorable if each of the strands in the projection can be colored in one of three different colors such that, at each crossing, all three colors ...
1 ... 4|5|6|7|8|9|10 ... 47 Previous Next

...