一类二阶微分方程的特征值估计及其反问题

借助Rouché定理及渐近分析的方法,给出了边界条件含有特征参数的一类二阶微分方程的特征值渐近公式.运用特征值渐近公式给出了特征值反问题的一个惟一性结果及重构公式.     

奇异Sturm-Liouville问题Weyl函数比较定理及应用

在正常S-L问题比较定理基础上,给出分离型边界条件下右定奇异S-L问题当势函数不同时Weyl函数比较定理,同时结合Weyl函数性质得到右定S-L问题特征值比较定理,且进一步给出势函数不同时奇异左定S-L问题特征值比较定理.     

一类正则Sturm—Liouville问题特征的渐近分析

考虑[0,π]上一类带一般分离型边界条件的正则Sturm—Liouville问题特征的渐近表示,利用Frechet导数,对特征值进行精细的分析,清楚地给出了方程系数q（x）及边界条件中常数cot α,col β对特征值的影响．使结论更具一般化．     

不定与定型Sturm-Liouville问题间特征值不等式

应用不定和定型Sturm-Liouville(S-L)问题在直和空间上的等价刻画,以及其特征值对边界和边值条件的单调依赖关系,本文建立了不定型S-L问题与一个相关的定型S-L问题之间的特征值不等式关系.     

左定Sturm-Liouville算子的特征值计算(英文)

研究了定义在有限区间[a,b]上的具有分离型和混合型边界条件的左定正则Sturm-Liouville算子的特征值问题.把具有混合型边界条件的左定正则Sturm-Liouville问题转化成二维的、具有分离型边界条件的右定正则Sturm-Liouville问题,给出了具有混合型边界条件的左定正则Sturm-Liouville算子的特征值的数值计算方法.     

带边紧致Riemann流形Dirichlet边界条件的第一特征值估计

本文给出带边界的紧致Riemann流形对应于Dirichlet边界条件的第一特征值的一些估计,这些估计改进了丘成相及P.Li[1]-[6]的有关结果。     

带边紧致Riemann流形Dirichlet边界条件的第一特征值估计

本文给出带边界的紧致Riemann流形对应于Dirichlet边界条件的第一特征值的一些估计,这些估计改进了丘成相及P.Li[1]-[6]的有关结果。     

一类特殊矩阵的特征值反问题

§1 引言 关于特征值反问题的历史沿革,作者在文[1]中已经作了介绍,当前研究得比较成熟的是对称三对角矩阵的特征值反问题。作者在文[2]中提供了一个对称三对角矩阵特征值反问题的实际应用例子。本文考虑如下形状矩阵的特征值反问题:设     

非自伴Sturm-Liouville算子的渐近迹

<正> 本文研究下列带一般两点边界条件的一维Schrodinger方程的特征值问题的渐近迹其中q(x)是[0,π]上的光滑复值函数,a_k,b_k是复常数. (E)的古典情形(Sturm-Liouville问题)的迹,自1953年以来,已引起国内外一系     

边界条件都含有特征参数的四阶微分算子特征值的依赖性

本文考虑了区间[a,b]两端四个边界条件都含有特征函数的四阶微分算子特征值的依赖性问题,证明了特征值不仅连续依赖而且可微依赖于问题的各个参数(系数函数,权函数,区间端点,边界条件系数矩阵),并且给出了相应的微分表达式.特别地,给出特征值关于特征参数依赖的边界条件系数矩阵的Frechet导数.     

Extreme values of the sum of squares of degrees of bipartite graphs

In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Radius of convexity of certain classes of analytic functions

We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。