查询词典 solvable

In section 4,we research the solvable groups of finite rank,and provethat the union set of all quasi-cyclic subgroups of G is a characteristic subgroup andthe Hirsch number hdoes not exceed n if G is a solvable group of rank n.Inparticular,for an arbitrary solvable torsion-free group G of rank n,we give theupper bound fof the derived length of G.

在第4节里，我们研究了有限秩的可解群，证明了这类群的所有拟循环子群构成它的一个特征子群，且对秩n的可解群G来说，其Hirsch数h≤n，另外，我们给出了秩n的无挠可解群的导出长度的一个上界。

When the graph Г′ is not connected, Our results are as following: if G is non-solvable then G is a Frobenius group; and if G is solvable then 2≤nl ≤4 for Fitting height nl of G.

我们给出了Γ′不连通时有限群G的结构：当G不可解时，G只能是Frobenius群；而当G可解时，也有2≤nl≤4。

For different polynomials g, if the characteristic polynomial of a n matrix A is irreducible, then we get some theorems to determine matrix equations g =A solvable; if it is reducible, then, to see n-dimension space vectors M over a field F as F-module, we use module theory to determine these equations solvable such that it is simpler and clearer to investigate these questions.

对于不同多项式g，当n阶矩阵A的特征多项式为不可约的，我们给出了矩阵方程g=A有解的判定定理；当A的特征多项式为可约的，把域F上的n维线性空间M作为由A导出的F -模，我们利用模论知识来决定矩阵方程g=A有解性，从而使这一问题变了简单，研究思路更加清晰。

Formulas in the MAX(1) and MARG(1), it is shown that the literal renaming problems are solvable in linear time, and the variable renaming problems are solvable in quadratic time.

证明了对于MAX(1)和MARG(1)中的公式，文字改名问题在线性时间内可解，变元改名问题在平方次时间内可解。

Suppose G_1 is solvable,is it true that G_2 is necessarily solvable?Some authors who work on group theorem study the topic of influence on the number of maximal order on a finite group to study the Thompson\'s Problem nondirectly.

一些群论工作者从群的最高阶元的个数出发来研究有限群，侧面对Thompson问题进行了研究，得到了一些令人鼓舞的结果参见文献[10]，(来源：3dABC论文网www.abclunwen.com[11]，[12]，[13]，[14]，但是，至今没有人对J.G。

This dissertation proves that the class of monotone increase functions is PAC solvable while the class of single peak functions is non-PAC solvable under a GA with reproduction and a mutation operator which mutate according to a pre-set order.

本文提出了概率意义上近似收敛可解的概念，并证明了随机行走和狄拉克δ函数都是非PAC可解的，证明了任何问题在只有杂交算符或变异算符的遗传算法下都是非PAC可解的。

Based on the limitation and tightness of computational time, it is concluded that the neighborhood of the equation solution is solvable under the condition of open solvable set.

研究了用差分法求解自治的发展方程时稳定性和收敛性这两个基本概念之间的联系，利用计算时间的有限性和紧致性，在可解集为开集的条件下，得出方程解的邻近也可解的结论。

The Lewy equation is locally solvable and globally solvable,and we have got the analytic expressions of the local solution and the global solution.So we obtain the conclution "when ,Lewy's equation (5) has solution ".

Lewy方程是局部可解与整体可解的，我们已经获得了其局部可微解与整体可微解的解析表达式，获得了"Lewy方程（5）当，则有解"的结论。

We first characterize the groups in which all m∈cdq〓 contain at most 4 prime divisors; and then show the following: if any m∈cdq〓 is nth-power-free then the derived length of solvable group G is bounded by a function f depended only on n; also if cdq〓 has k different p-parts then the p-length of solvable group G is bounded by a function g depended only on k.

首先研究了非线性不可约特征标对应的特征标次数的商至多含有4个素因子的有限群结构。其次，我们证明：若每m∈cdq〓是n次方自由的，则有限可解群G的的导长及p-长都被仅依赖于n的函数所界定；若cdq〓中共有k个两两不同的p-部分，则有限可解群G的p-长能被仅依赖于k的函数所界定。

With the help of its structure, this paper points out that the non-commutative finite solvable subsimple group will necessarily be a qualitative element group. And referring to the nature of qualitative element group, it can be easily identified the conditions that the ordered prime divisors in a solvable initial finite subsimple group should meet. Suppose that G is always a finite group.

利用其结构，指出了非交换可解有限次单群必为质元群，从而利用质元群的性质，可以很容易地初步确定了可解有限次单群的阶中素因子之间所必须满足的条件，主要得到下面的一些结论：定理1 G是非交换的可解有限次单群，则G′是G的唯一的非平凡正规子群，并且G′是初等交换p -群，此时| G |= p~n q，|G′|=p~n，。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。