查询词典 chromatic polynomial

Firstly, this paper describes the history and state of the research to the minimal polynomial and the characteristic polynomial and then gives the main methods and its computational complexities for computing the characteristic polynomial and of a constant matrix, the characteristic polynomial of a polynomial matrix and the minimal polynomial of a polynomial.

本文先叙述了对最小多项式和特征多项式的国内外的研究历史和现状，然后给出了已有的计算常数矩阵特征多项式、多项式矩阵的特征多项式和常数矩阵最小多项式的主要算法及其复杂性。

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按"序"最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按&序&最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

When to get the coefficients of polynomial directly,the ill-conditioned matrix may be produced and effect the precision of result.Using orthogonal polynomial can avoid this problem.This paper introduces 4 orthogonal polynomial.In our discussion,it is proposed to use Chebyshev polynomial and Legendre polynomial,they are easier to sa...

讨论4种常用正交多项式在拟合卫星轨道与时间函数时的适用性；通过计算实例说明利用切比雪夫多项式和勒让德多项式做数据拟合时具有很高的精度；分析得出评定多项式拟合数据精度的适用阶数，实际应用中可降低工作量，提高计算效率；最后讨论同一多项式阶数下不同历元数对拟合结果的影响。

A new method that transforms bitlevel waveform polynomial to word-level polynomial model is given, allowing for simple composition This method offers an efficient way to determine whether two descriptions from different design levels are equivalent, so component reuse, synthesis and verification across design levels can be realized. In addition, an experimental system using C language is established, including modules such as representation of waveform polynomial, decision of path senstization, delay computing, clocking based on single-period sensitization, clocking based on multi-period sensitization, test generation considering noise and transformation from bit-level waveform polynomial to word-level polynomial model. They respectively used to test models and techniques proposed in this paper.

另外，基于C语言本人设计开发了一个实验软件系统，该系统包括波形多项式表示模块、敏化通路判定模块、延时计算模块、单周期敏化的最小时钟周期精确确定模块、多周期敏化的最小时钟周期确定方法模块、考虑噪声的测试生成模块和位级波形多项式描述转化成字级多项式描述模块，分别用于对本文各章中提出的自动化设计的模型和方法进行实验验证。

At last, we learn the property of the problem on the relaxed game chromatic on graphs. Then we introduce the concept of edge relaxed game chromatic number, and we give the upbound of edge relaxed game chromatic number of chain and cycle.

最后对于松弛对策着色问题进行了初步的探讨，提出了边松弛对策着色问题，给出了边松弛对策色数的概念，并给出了链、圈的边松弛对策色数的上界。

Then we investigate a variation of the edge game chromatic number of a graph called edge game chromatic numberⅡ, and also we give the upbound of edge game chromatic number II of some simple graphs.

我们还提出了第二边对策色数这个概念，在此基础上给出了几类简单图的第二边对策色数的上界。

Answer: On-line shopping chromatic aberration is avoidless,each picture we can proofread the color according to the material object,but in the different environment light, under the monitor will have the chromatic aberration question,please completely do not accept any chromatic aberration the buyer to consider after clear, will purchase.

答：网上购物色差是无法避免的，每张照片我们都会根据实物校对过颜色，但在不同的环境灯光，显示器下都会有色差问题，请完全不能接受任何色差的买家考虑清楚后购买。

Among which is the mindset, perceptions and moralities of those who accept mini- military tasks for economic gains.

其中最重要的是心态，观念和道德的人谁接受小型军事任务的经济收益。

In time course imaging, activity peaked 2 days after coronary ligation.

在时程成像检测，活性峰值在冠脉结扎后2天。