- 更多网络例句与不可约因子相关的网络例句 [注：此内容来源于网络，仅供参考]
-
We establish a relation between μ and the stucture of the group G, and obtain the lower bound of the ratio by the mininal prime divisor of the order and commutator of the group G, and give a necessary and sufficient condition under which this lower bound is attained.
第一部分，记有限群G的阶与不可约特征标个数的比值为μ，我们研究了一般的非交换有限群G的结构和μ之间的关系，通过群G的阶的最小素因子和换位子群G′的最小素因子得到了μ的一个下界，同时给出了达到下界的一个充分必要条件。
-
By using the group-chain, the wavefunctions of the 4f〓 configuration for RE ions are also expressed as linear combinations of group-chain basis functions in Butler's irreducible representation notation. The matrix elements of the CF Hamiltonian then are calculated by means of the Wigner-Eckart theorem and factorization lemma of the jm factors. Before the CF level fitting, a point-charge calculation of the conventional CF parameters B〓 has been performed by means of the lattice-sum technique from the known crystal structure data. The corresponding parameters in the group-chain are calculated by the conversion relationship between two schemes that proved identical in essence, which are usually used as initial values in the fit to the experimental levels. The ratios of the same k-value CF parameters are suggested as the constraint conditions in the fit, in order to utilize fully the symmetry distortion degree of the studied system.
利用群链理论，属稀土离子4f〓组态的波函数表示为以不可约表示标记的群链基波函数的线性组合；借助Wigner-Eckart定理和2jm和3jm因子的分解定律计算了晶场哈密顿的矩阵元；根据点电荷模型和已知晶体结构数据，利用点阵求和技术计算得到传统晶场参数B〓初值，相应的非传统形式的群链参数初值则由两种方案下的转换关系求得；这些初值通常作为非线性拟合晶场能级计算的初值，系统的对称性畸变信息则反映在以同阶晶场参数的比值作为能级拟合的约束条件。
-
We obtain new lower bounds for the sum of degrees of simple and distinctirreducible factors of the polynomial f1 +···+ fn, where fi(1≤i≤n) are pairwise relatively prime polynomials of several variables with coefficients in C.
七我们对形如f1 +···+ fn的多项式的单重不可约因子的次数和及不同不可约因子的次数和的下界分别作出新的估计，其中fi(1≤i≤n)为系数在C中的两两互素的不可约多项式。
-
Firstly, we give a necessary and sufficient condition for a nonnegative square matrix to be decomposed into a product of a finite number of irreducible nonnegative matrices in chapter 1. We prove it by using Frobenius normal form in combinational matrix theory and associated directed graph in graph theory. In addition, we can limit the number of factors to three, and construct every factor.
首先，在第一章中，我们给出了一个非负矩阵可以分解成有限多个不可约非负阵的乘积的充要条件，证明过程利用了组合矩阵论中的Frobenius标准型和图论中的伴随有向图，并且将乘积中的因子个数限制到三个，具体地构造出了分解式中的每个不可约非负阵。
-
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的函数所界定。
- 更多网络解释与不可约因子相关的网络解释 [注：此内容来源于网络，仅供参考]
-
irreducible equation：不可约方程
irreducible element 不可约元 | irreducible equation 不可约方程 | irreducible factor 不可约因子
-
irreducible factor：不可约因子
irreducible equation 不可约方程 | irreducible factor 不可约因子 | irreducible generating set 不可约生成集
-
irreducible generating set：不可约生成集
irreducible factor 不可约因子 | irreducible generating set 不可约生成集 | irreducible markov chain 不可约马尔可夫链