- 更多网络例句与不可分解地相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Concretely, we hope to know whether a central hyperplane arrangement can be decomposed into several irreducible subarrangements or not.
具体地讲，希望知道能否把中心构形分解为若干个不能再分解的子构形，把对中心构形的研究归结为对它的不可约子构形的研究。
-
In this paper,we determine J_~(2~k+2v)by constructing ingeniously indecomposable manifolds M,which can be generators in MO_*,and defining appropriate(Z_2)~k-action on M.
在本文中，我们通过巧妙地构造流形M，使其所在的上协边类不可分解，从而可以作为上协边环MO_*的生成元，并在M上定义适当的(Z_2)~k作用使其不动点集F具有常余维数r，决定了未定向上协边环MO_*的理想J_~(2~k+2v)。
-
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标准型和图论中的伴随有向图，并且将乘积中的因子个数限制到三个，具体地构造出了分解式中的每个不可约非负阵。
-
In order to determine the solution set of the equation , by the means of meet-irreducible element and irredundant finite meet-decomposition, we first obtain the maximal solutions to the simple equation in the case that b has an irredundant finite meet-decomposition, and then consider the relation between the equation and the equation , based on this, we obtain the maximal solutions to the equation in the case that each element of the matrix B has an irredundant finite meet-decomposition and so determine its solution set completely.
为了确定方程的解集，本文利用交既约元与不可缩短的有限交分解等工具，同样地先求出简单形式的型矩阵方程的所有极大解，然后讨论方程与方程之间的关系，在此基础上，在B的每个元素均有不可缩短的有限交分解的情况下，求出了方程的所有极大解，从而完全确定了方程的解集。
- 更多网络解释与不可分解地相关的网络解释 [注：此内容来源于网络，仅供参考]
-
monolith：巨石
新制度主义往往简单地将政府管理归为制度环境,而将教育的供应单位(如教材供应商)划分为技术环境;往往静止地将学校划分为强制度环境和弱技术环境的组织类型;往往片面地将制度环境、组织(学校)的技术结构看成是一块不可分解的独立的"巨石"(monolith)来看待.