| 单词 | Depth (Tree) |
| 释义 | Depth (Tree)The depth of a Resolving Tree is the number of levels of links, not including the top. The depth of the link is the minimal depth for any Resolving Tree of that link. The only links oflength 0 are the trivial links. A Knot of length 1 is always a trivial Knot andlinks of depth one are always Hopf Links, possibly with a few additional trivialcomponents (Bleiler and Scharlemann). The Links of depth two have also been classified (Thompson andScharlemann).
Adams, C. C. The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. New York: W. H. Freeman, p. 169, 1994. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。