带权情形Г算子线性组合导数的Lp-逼近

本文利用带权情形Ditzian—Totik无滑模与对应的K-泛函的等价Lp-度量中给出了Г算子线性组合导数的全局逼近的特征刻画，本文的结果实质性的推广了文[3]中的主要结果．     

Stein流形局部q-凸域上带权因子的同伦公式和-方程

本文得到了Ｓｔｅｉｎ流形局部ｑ－凸域上（ｒ，Ｓ）型微分形式的带权因子的同伦公式及其－方程的带权因子的解．     

带权Paneitz算子和带权圆盘振动问题的特征值不等式

本文研究光滑度量测度空间上带权Paneitz算子的闭特征值问题和带权圆盘振动问题,给出Euclid空间、单位球面、射影空间和一般Riemann流形的n维紧子流形的权重Paneitz箅子和带权圆盘振动问题的前n个特征值上界估计.进一步地,本文给出带权Ricci曲率有界的紧致度量测度空间上带权圆盘振动问题的第一特征值的下界...     

复流形局部q-凸楔形上带权的同伦公式

本文得到复流形局部q-凸楔形上(r,s)型微分形式的带权的同伦公式和(r,s)型的方程的带权的连续解,并给出(r,s)型微分形式的不含边界积分的新的带权的同伦公式和(r,s)型的方程的新的带权的连续解.这些新的带权公式尤其适用于具有非光滑边界的局部q-凸楔形,这时不但可以避免边界积分的复杂估计,而且积分密度也不必在边界有定义,只要在区域上有定义就行.其次,引进权因子,带权的积分公式在应用上(比如在函数的插值方面)具有更大的灵活性.     

复流形上具有非光滑边界的强拟凸域上带权因子的Koppelman-Leray公式

利用权因子,我们得到了复流形上边界不必光滑的强拟凸域上（狆,狇）微分形式的带权因子的Ｋｏｐｐｅｌｍａｎ Ｌｅｒａｙ公式及其 方程的带权因子的解,其特点是不含有边界积分,从而避免了边界积分的复杂估计．其次,引进了权因子,带权因子的积分公式在应用上具有更大的灵活性．     

C~n中具有逐块光滑边界的有界域上带权因子积分表示的拓广式

本文讨论了Cn空间中具有逐块光滑边界的有界域上和强拟凸域上具有拓广的B-M核的(0,q)形式的带权因子的积分表示式,得到了带权因子拓广的Koppelman- Leray-Norguet公式．由此得到了有界域上-方程带权因子的连续解,由于权因子的引入,使得积分公式在应用上(如在函数插值问题的应用)具有更大的灵活性．     

带变系数的第二类奇异积分方程的Galerkin解法

基于对未知函数用适当的正交多项式进行逼近，本文讨论了带变系数的第二类奇异积分方程的Galerkin解法，证明了逼近解的存在唯一性，给出了逼近解在带权L^2模和一致模下的误差估计．     

Stein流形局部q—凸域上带权因子的同伦公式和e↓—方程

本文得到了Ｓｔｅｉｎ流形局部ｑ－凸域上（ｒ,Ｓ）型微分形式的带权因子的同伦公式及其ｅ－方程的带权因子的解。     

Stein流形局部q-凸域上带权因子的同伦公式和(ē)-方程

本文得到了Stein流形局部q-凸域上(r, S)型微分形式的带权因子的同伦公式及其(ē)-方程的带权因子的解.     

基于函数插值的计算线性算子的Drazin逆和带W-权Drazin逆的迭代法

本文中对HiIbert 空间中有界线性算子的带W-权Drazin 逆给出一个统一表示定理。並给出基于Newton插值和Hermite插值的计算Hilberφ空间有界线性算子 Drazin逆和带W-权Drazin 逆的两个迭代法、並给出了渐近误差界。 数值例子表明,矩阵的带W-权Draxin逆可以用这两个迭代法计算,並且后一种方法收敛速度快于前一种方法。     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

Two questions on semi-clean group rings

It was proved in [4] that every group ring of a torsion abelian group over a commutative local ring is a semi-clean ring. It was asked in [4] whether every group ring of a torsion abelian group over a commutative clean ring is a semi-clean ring and whether every group ring of a torsion abelian group over a commutative semi-clean ring is a semi-clean ring. In this paper, we give a positive answer to question 1 and a negative answer to question 2.     

A Dynamic Frictional Contact Problem with Normal Damped Response

We consider a mathematical model which describes the frictional contact between a viscoelastic body and a reactive foundation. The process is assumed to be dynamic and the contact is modeled with a general normal damped response condition and a local friction law. We present a variational formulation of the problem and prove the existence and uniqueness of the weak solution, using results on evolution equations with monotone operators and a fixed point argument. We then introduce and study a fully discrete numerical approximation scheme of the variational problem, in terms of the velocity variable. The numerical scheme has a unique solution. We derive error estimates under additional regularity assumptions on the data and the solution.     

New parameters of subsets in polynomial association schemes

We define new parameters, a zero interval and a dual zero interval, of subsets in P- or Q-polynomial association schemes. A zero interval of a subset in a P-polynomial association scheme is a successive interval index for which the inner distribution vanishes, and a dual zero interval of a subset in a Q-polynomial association scheme is a successive interval index for which the dual inner distribution vanishes. We derive bounds of the lengths of a zero interval and a dual zero interval using the degree and dual degree respectively, and show that a subset in a P-polynomial association scheme (resp. a Q-polynomial association scheme) having a large length of a zero interval (resp. a dual zero interval) induces a completely regular code (resp. a Q-polynomial association scheme). Moreover, we consider the spherical analogue of a dual zero interval.     

关于模N的原根的逆及其整除性

本文研究了模ｎ的原根、逆及其整除性，并给出了一个关于ｍｉｎ（ａ－ａ＝１·ｋ１０、ａａＪ“＋ａ－ａ）的较强的渐近公式。     

A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge

This paper considers a two-stage distribution problem of a supply chain that is associated with a fixed charge. Two kinds of cost are involved in this problem: a continuous cost that linearly increases with the amount transported between a source and a destination, and secondly, a fixed charge, that incurs whenever there exists a transportation of a non-zero quantity between a source and a destination. The objective criterion is the minimisation of the total cost of distribution. A genetic algorithm (GA) that belongs to evolutionary search heuristics is proposed and illustrated. The proposed methodology is evaluated for its solution quality by comparing it with the approximate and lower bound solutions. Thus, the comparison reveals that the GA generates better solution than the approximation method and is capable of providing solution either equal or closer to the lower bound solution of the problem.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

Lifting Property of Direct Sums of Hollow Modules

We give necessary and sufficient conditions for a module M with a decomposition that complements maximal direct summands to be a lifting module. We apply our results to get a necessary and sufficient condition for a direct sum of modules to be a quasi-discrete (discrete) module. We also give some sufficient conditions for a lifting module to be a direct sum of indecomposables.     

Partnership formation based on multiple traits

A model of partnership formation based on two traits, called beauty and character, is presented. There are two classes of individual and partners must be of different classes. Individuals prefer prospective partners with a high beauty measure and of a similar character. This problem may be interpreted as e.g. a job search problem in which the classes are employer and employee, or a mate choice problem in which the classes are male and female. Beauty can be observed instantly. However, a costly date (or interview) is required to observe the character of a prospective partner. On observing the beauty of a prospective partner, an individual decides whether he/she wishes to date. During a date, the participants observe each other’s character and then decide whether to form a pair. Mutual acceptance is required both for a date to occur and pair formation. On finding a partner, an individual stops searching. Beauty has a continuous distribution on a finite interval, while character ‘forms a circle’ and has a uniform distribution. Criteria based on the concept of a subgame perfect Nash equilibrium are used to define a symmetric equilibrium of this game. It is argued that this equilibrium is unique. When dating costs are high, this equilibrium is a block separating equilibrium as in more classical formulations of two-sided job search problems. However, for sufficiently small dating costs the form of this equilibrium is essentially different.