组合线性算子

本文给出一种构造组合线性逼近算子的方法，由此可得到具有特殊逼近性质的线性算子．     

象征算子的紧算子逼近算法和逼近速度

传统的微分方程的方法是利用Taylor展开用主象征逼近象征;本文用充分好的紧算子来逼近象征算子,并且逼近算子在算子范数意义下快速逼近原来的算子.     

F格上的逼近算子

粗集理论是波兰学者Pawlak提出的知识表示新理论.Pawlak代数是粗集理论中粗集系统的抽象,其公理系统包含了知识粗表示所必须的全部性质.本文深入研究了F格上的逼近算子,建立了F格上弱逼近算子之间的某些代数运算,从而从理论上建立了各种知识粗表示之间的联系.我们还定义了逼近算子的闭包,进而用逼近算子导出拓扑,为信息系统的近似提供必要的数学基础.最后,作为特例,我们研究了粗集理论中由相似关系导出逼近算子的某些性质.     

冯·诺依曼代数的可测算子的性质

本文研究了冯·诺依曼代数的可测算子的基本性质,定义了阶梯算子,证明了任意一个正可测算子可以由阶梯算子在定义域内按照强算子拓扑逼近,从而证明了任意一个可测算子可以由投影在定义域内按照强算子拓扑逼近.此外,还讨论了可测算子与有界算子的复合算子的可测性.     

某些多元线性正算子的加权逼近

本文首先给出了在Ｌｐ逼近意义下某些线性正算子加Ｊａｃｏｂｉ权逼近时的特征定理，作为应用，我们给出了多元Ｂａｓｋａｋｏｖ型算子、多元Ｓｚａｓｚ－Ｍｉｒａｋｊａｎ型算子和多元Ｂｅｔａ算子加权逼近时的特征刻划．     

Shepard-Lagrange算子的逼近

本文建立了Shepard-Lagrange算子逼近的正逆定理,证明了可以利用高阶光滑模来刻画Shepard-Lagrange算子的逼近性质.从而说明了Shepard-Lagrange算子比一般的Shepard算子具有更好的逼近性质.进一步,所用光滑模的阶梯函数非常广泛,这是多项式逼近所不具有的.     

Cardaliguet-Eurrard型神经网络算子逼近

研究多维Cardaliguet-Eurrard型神经网络算子的逼近问题.分别给出该神经网络算子逼近连续函数与可导函数的速度估计,建立了Jackson型不等式.     

一类乘子算子在全测度集上的逼近

本文给出了研究乘子算子在全测度集上逼近的一种框架.在 Riesz 极大算子有界的条件下,确定了一类乘子算子在 Riesz 位势空间上几乎处处逼近的阶.并用于讨论广义 Bochner-Riesz 平均和 Abel-Cartwright 平均的点态逼近.     

多元Stancu算子的Boolean和迭代

定义单纯形上高维Stancu算子的Boolean和迭代算子并且研究它逼近连续函数的正定理、逆定理与饱和定理，得到了较高的逼近阶．     

修正的q-Baskakov-Durrmeyer-Stancu算子的逼近性质

基于q-微积分的概念引入一类修正的Stancu型q-Baskakov-Durrmeyerr算子,并且借助连续模研究该算子的一些局部逼近性质,得到了算子的局部逼近定理.同时讨论的算子的加权逼近.     

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.     

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.     

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.     

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

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

L－fuzzy集网的R－收敛性质

本文在ＬＦ拓扑空间中建立了Ｌ－ｆｕｚｚｙ集网的弱收敛（Ｒ－收敛）概念，应用文［４］中的Ｒ－闭包，系统讨论了它们的性质，证明了等式ＲｌｉｍＡ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ和ＲｌｉｍＡ＿ｎ＝Ａ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ并且给出了Ｌ－ｆｕｚｚｙ集网与其子网之间的关系。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

两种图多项式根的重数的一个注记

设P1，P2，……，Pt是几乎覆盖图G的l条不相交的路，s是没有被这些路覆盖的孤立点数．本证明：(i)匹配多项式μ(G，x)的非零根的重数最多是l，零根的重数最多l s。（ii)对于不含三角形的n阶图G，伴随多项式h(G，x)的非零根的重数最多是l，零根的重数最多是1/2(n l s)．(iii)对一种含三角形的所谓A型图，（ii）也成立．     

任意矩阵的特征值的扰动估计

设A和B是两个任意的n阶方阵,其特征值分别为{λ_1,…,λ_n}和{μ_1,…,μ_n}.本文对此两组特征值的如下“距离”的界给出了若干估计: B对于A的谱改变量 A与B的特征值的改变量这里的结果包含了Bauer-Fike定理,并且优于Kahan-Parlett/Jiang定理及Chu,施和肖所得出的结果.     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.