1.
The theorem hAS many deep extensions which are important not only in graph theory and combinatorics but in set theory(logic)analysis AS well
这个定理有许多深刻的推广,它们不仅在图论和组合论中是重要的,而且在集论(逻辑)和分析中是同样重要的。
2.
This leads us to another contribution of Leonhard Euler to graph theory, namely Euler's polyhedron theorem or simply Euler's formula
这是我们引向L?尤拉对图论的另一个贡献,即尤拉多面体定理,或简称尤拉公式。
3.
Applications of Theorem 2 can be found in the anonymous Hebrew mystical work "Sefer Yetzirah" (the book of Creation)
定理2的应用可以在佚名的希伯莱神秘著作《Sefer Yetzirah》(创造集)中找到。
4.
The cheapest way to get one IS to invoke the spectral theorem and to conclude that normal operators always have non-trivial invariant subspaces
取得这样结果的最省力的尝试是引用光谱定理而得到正规算子恒有非平凡不变子空间的结论。
5.
Let us consider the implication of the electrostatic theorem for chemical bondIng In diatomic molecules
让我们讨论双原子分子化学成键所蕴含的静电定理。
6.
As a particular of Rado's theorem and the compactness theorem one obtains the following result
作为Rado定理和紧致性定理的一种特殊情形,我们得到下面的结果。
7.
coding theorem of multi - user channel
多用户信道编码定理
8.
The most plausible operatorial generalization of result of preceding paragraph is known as the "mean ergodic theorem for unitary operators."
前段结果可以推广到算子去,其中最近情近理的推广是“单算子的平均遍历定理”。
9.
The cheapest way to get one is.to invoke the spectral theorem and to conclude that normal operators always have non-trivial invariant subspaces
取得这样结果的最省力的尝试是引用光谱定理而得到正规算子恒有非平凡不变子空间的结论。
10.
mechanical theorem proving
定理机器证明