Tchebycheff插值余项及其在T-样条中的应用

在多项式逼近理论及样条逼近的讨论中,Hermite多项式余项讨论是很重要的。作者在以前一系列工作中(〔1,2〕),对于插值Hermite多项式的余项给出一系列表达式,特别是各阶导数余项的表达式。运用这些表达式成功地讨论了一系列样条函数。给出它们的余项估计和渐近展开。     

关于Bernstein型多项式导数的特征

利用高阶光滑模研究Bernstein型多项式的高阶导数问题，用函数的光滑性刻画Bernstein型多项式的高阶导数的特征，得到了一个等价定理。     

基于Lascenov多项式零点的(0,2)-插值的正则性

本文给出了基于Ｌａｓｃｅｎｏｖ多项式零点（０，２）－插值正则性的充要条件，并给出基多项式存在时的明显表达式。     

ECT插值余项的表示及其应用

在多项式插值理论及样条逼近中,Hermite插值多项式余项的讨论是很重要的。在[1,2]中,给出了一系列Hermite插值多项式余项的表达式,特别是各阶导数余项的表达式。还运用这些表达式讨论了样条函数,给出其余项估计和渐近展开。 随着样条理论的发展,已经用其它函数系代替多项式组成了各种样条函数空间,其中最引人注目的是ECT样条。Pruess讨论的张力样条及C.A.Micchelli讨论的?-样     

导数在因式分解和化简中的应用

用导数进行因式分解和简化代数三角表达式有时非常简单,下面我们就一些例子说明导数在这方面的应用。     

整函数与其两个导数CM共享一个值

该文研究了与两个导数共享一个非零、有穷值的整函数的唯一性问题，给出了函数确定的表达式，回答了仪洪勋，杨重骏提出的一个问题     

关于ARMA序列协方差矩阵的逆

本文用矩阵方法导出ＡＲＭＡ（ｐ，ｑ）序列协方差阵的逆的一种表达式，由它可以较快计算平方和函数及其偏导数，还可以求得初值为零的条件平方和函数的误差。     

论多元Newton插值

本文研究多元Newton插值的性质,特别是给出了余项及其任意阶导数的表达式以及估值。     

二阶矩阵的n次方和n次方根

利用Chebyshev多项式讨论了二阶矩阵的n次方的各元素的表达式和其n次方根的存在条件.     

极限环的表达式和计算

本文提出一种解析法和数值法相结合的方法，用来计算多项式微分系统的极限环，极限环表示为x=∑k≥0(ak cos kφ bk sin kφ),y=∑k≥0(ck cos kφ dk sin kφ)，先用解析法求出小参数时极限环的初始表达式，然后用增量法和迭代法求出任意参数时极限环满足给定精度的表达式，半稳定极限环和分叉值也可以计算。     

矩阵特征多项式的图论计算公式

给出了赋权有向图邻接矩阵特征多项式的图论计算公式,从而得到了一般矩阵特征多项式的图论计算方法,并且研究了赋权有向图邻接矩阵特征多项式和谱半径的一些性质．     

On the Location of Roots of Graph Polynomials

Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph theoretic properties of the underlying graph.     

超图的Laplacian

本文讨论了由Ｆ．Ｒ．Ｋ．Ｃｈｕｎｇ 引入的ｋ－图的Ｌａｐｌａｃｉａｎ 的一些基本性质．通过引入ｋ－图的邻接图的概念,得到了ｋ－图的Ｌａｐｌａｃｉａｎ 及其特征多项式的更明确的表达式．同时,也改进了文［１］中关于ｄ－正则ｋ－图的谱值的一个下界     

Generalized characteristic polynomials of graph bundles

In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic polynomial of the graph. Since the reciprocal of the Bartholdi zeta function of a graph can be derived from the generalized characteristic polynomial of a graph, consequently, the Bartholdi zeta function of a graph bundle can be computed by using our computational formulae.     

On the reconstruction of graph invariants

The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the vertex-deleted deck, and in particular, some prominent graph polynomials. Among these are the Tutte polynomial, the chromatic polynomial and the characteristic polynomial. We show that the interlace polynomial, the U-polynomial, the universal edge elimination polynomial ξ and the colored versions of the latter two are reconstructible.We also present a method of reconstructing boolean graph invariants, or in other words, proving recognizability of graph properties (of colored or uncolored graphs), using first order logic.     

Characteristic polynomials of symmetric graphs

In this paper, we study the characteristic polynomials of graphs which admit semifree actions of an abelian group. Using the method of group matrices, we are able to show that the characteristic polynomial of a such a graph is factorized into a product of a polynomial associated to the orbit of the action and a polynomial associated to the free part of the action.     

The group and the minimal polynomial of a graph

This paper presents some results linking the minimal polynomial of the adjacency matrix of a graph with its group structure. An upper bound on the order of the group is derived for graphs whose minimal and characteristic polynomials are identical. It is also shown that for a graph with transitive group, the degree of the minimal polynomial is bounded above by the number of orbits of the stabilizer of any given element. Finally, the order of the group of a point-symmetric graph with a prime number of points is shown to depend on the degree of the minimal polynomial, and an algorithm for constructing such a group is given.     

A certain polynomial of a graph and graphs with an extremal number of trees

The polynomial we consider here is the characteristic polynomial of a certain (not adjacency) matrix associated with a graph. This polynomial was introduced in connection with the problem of counting spanning trees in graphs [8]. In the present paper the properties of this polynomial are used to construct some classes of graphs with an extremal numbers of spanning trees.     

NP完全问题多项式时间算法研究

本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法 .以往利用线性规划 (LP)技术来分析NP完全问题中的TSP问题 ,因其存在子环游问题 ,从而使问题得不到有效解决 .文中发展一分层网络 ,在求解TSP问题时 ,存在另一类(不完全 )子环游问题 .但两模型允许解集的交集避免了两类子环游基本可行解 ,从而使TSP问题可利用LP技术多项式时间内得以解决 ,同时给出了求哈密尔顿回路的多项式标记证明方法 ,开创了NPC问题研究的新局面 .     

On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

The characteristic polynomial of the adjacency matrix of the subdivision graph G is related to the characteristic polynomials of the adjacency matrices of g and its line graph.