查询词典 conjecture

The major technique to get the information of structure of those free groups is to sudy the action of automorphisms on them. In this paper we show that every normal automorphism of a nontrivial free product of groups is inner as well. Traub[16] made a purely algebraic conjecture and showed that it implied Poincare"s Conjecture. He also showed that Poincare"s Conjecture implied this algebraic conjecture modulo another topological hypothesis.

在本文中我们给出任意两个非平凡群的自由积的每个正规自同构也是内自同构的；在文献[16]中，Traub给出了一个纯代数的猜想并证明了这个猜想蕴含着着庞加莱猜想的成立，并且作者也证明了在一个拓扑假设的前提下庞加莱猜想也同时蕴涵着猜想1是成立的，后来这个拓扑假设被Waldhausen([7])证明是成立的。

It consists of the next three aspects: firstly, we study Murthys' open problem whether the augmented matrix is a Q0-matrix for an arbitary square matrix A , provide an affirmable answer to this problem , obtain the augmented matrix of a sufficient matrix is a sufficient matrix and prove the Graves algorithm can be used to solve linear complementarity problem with bisymmetry Po-matrices; Secondly, we study Murthys' conjecture about positive semidefinite matrices and provide some sufficient conditions such that a matrix is a positive semidefinite matrix, we also study Pang's conjecture , obtain two conditions when R0-matrices and Q-matrices are equivelent and some properties about E0 ∩ Q-matrices; Lastly, we give a counterexample to prove Danao's conjecture that if A is a Po-matrix, A ∈ E' A ∈ P1* is false, point out some mistakes of Murthys in [20] , obtain when n = 2 or 3, A ∈ E' A ∈ P1*, i.e.

本文分为三个部分，主要研究了线性互补问题的几个相关的公开问题以及猜想：(1)研究了Murthy等在[2]中提出的公开问题，即对任意的矩阵A，其扩充矩阵是否为Q_0-矩阵，给出了肯定的回答，得到充分矩阵的扩充矩阵是充分矩阵，并讨论了Graves算法，证明了若A是双对称的P_0-矩阵时，LCP可由Graves算法给出；(2)研究了Murthy等在[6]中提出关于半正定矩阵的猜想，给出了半正定矩阵的一些充分条件，并研究了Pang~-猜想，得到了只R_0-矩阵与Q-矩阵的二个等价条件，以及E_0∩Q-矩阵的一些性质；(3)研究了Danao在[25]中提出的Danao猜想，即，若A为P_0-矩阵，则，我们给出了反例证明了此猜想当n≥4时不成立，指出了Murthy等在[20]中的一些错误，得到n=2，3时，即[25]中定理3.2中A∈P_0的条件可以去掉。

Secondly, a conjecture about the stability for these systems is proposed based on the sufficient and necessary condition of the isolated transfer function being positive real. When the zeros and poles of the transfer functions lie in the imaginary axis, a known conclusion is derived from the conjecture; while the zeros and poles are on the real axis, a new result is obtained and is proved in this note. Finally, according to the conjecture, an example with poles existing on the complex plane is presented, which is not only interesting but also challenging.

然后， 基于所有孤立部分传递函数都正实的充分必要条件给出了上述系统为稳定的一个猜想，当传递函数的零极点都位于虚轴上时，由这一猜想得到了一个已知的结论；当传递函数的零极点都位于实轴上时，由这一猜想得到了一个新的结论，本文证明该结论是正确的；最后，根据这一猜想，给出了传递函数极点位于复平面的一个例子，它涉及到一类系数矩阵为时变正定矩阵的振动方程的稳定性问题，值得去深入研究。

Afterward Waldhausen ([7]) showed that this topological hypothesis was true. Besides, Stallings ([11]) gave another conjecture that was equivalent to Poincare"s Conjecture. Thus we know both conjectures made respec- tively by Traub and Stallings are equivalent to Poincare"s Conjecture.

另外Stallings([11])又提出了另一个代数的猜想并同时证明也证明了这个猜想与庞加莱猜想是等价的，由此可知Traub所给的猜想与Stallings的猜想都与庞加莱猜想是等价的，从而这两个代数的猜想也是等价的。

In telling the vibrant story of The Poincaré Conjecture, Donal O'Shea makes accessible to general readers for the first time the meaning of the conjecture, and brings alive the field of mathematics and the achievements of generations of mathematicians whose work have led to Perelman's proof of this famous conjecture.

Donal O'Shea 通过告诉读者 Poincaré猜想这个振奋人心的故事，让第一次接触到这个领域的大众读者们能够更容易的理解其意义，使数学领域更为形象化，以及赞扬了从古至今历代的数学家们，正是他们为数学做出的杰出贡献才使得Perelman的有关数据更具有了说服力。

But they have no knowledge therein. They follow nothing but conjecture; and conjecture avails nothing against Truth.

他们对于那种称呼，绝无任何知识，他们只凭猜想；而猜想对于真理，确是毫无裨益的。

Basis on this result, Chen, Lih and Wu put forth the following conjecture:Conjecture 2 For any connected graph G, except K_m, C_(2m+1) and K_(2m+1,2m+1) for all m ≥ 0,then G is equitably △—colorable .

基于这一结果，Chen，Lih和Wu提出了以下猜想：猜想2：如果图G是一个既不是完全图，奇圈又不是完全二部图K_(2m+1，2m+1)，m≥0的连通图，那么G存在均匀Δ-染色。

On the ground of this search algorithm , the equivalent proposition of the Goldbach Conjecture for the even number as well as the equivalent proposition of the twin prime conjecture are deduced.

在这种搜索算法的基础上，既得到了孪生素数猜想的一个等价命题，也得到了偶数哥德巴赫猜想的一个等价命

Cao and Zhu claimed to have "the first written account of a complete proof of the Poincaré conjecture and the geometrization conjecture of Thurston."

他们宣称完成了"第一个写下来的庞加莱与瑟斯顿几何化猜想的完整证明。"

In allusion to Funar Conjecture :"If a random triangle lies in a closed unit square,then its inscribed circle s radius,r≤(5-1)/4",an equivalent minimum problem about a function of 2-variables is studied;the stagnation point and its value,value on the boundary of the function of 2-variables are studied,the equivalent problem is proved correct,so the Funar Conjecture is proved correct.

针对Funar猜想："设任意三角形位于闭单位正方形内，则该三角形的内切圆半径，r≤(5-1)/4"，研究了与其等价的某二元函数的最小值问题；利用对此二元函数驻点及其取值、边界取值讨论，证明了等价问题成立，进而此Funar猜想得证。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。