The Upper Bounds of Arbitrary Eigenvalues for Uniformly Elliptic Operators with Higher Orders

Let Ωbelong to R^m （m≥ 2） be a bounded domain with piecewise smooth and Lipschitz boundary δΩ Let t and r be two nonnegative integers with t ≥ r ＋ 1. In this paper, we consider the variable-coefficient eigenvalue problems with uniformly elliptic differential operators on the left-hand side and （-Δ）^T on the right-hand side. Some upper bounds of the arbitrary eigenvalue are obtained, and several known results are generalized.     

关于Montgomery的一个问题

本文解决了Montgomery提出的一个问题．     

关于Strichartz的一个谱对准则

研究了与压缩迭代函数系和扩张迭代函数系相关的自仿测度的谱性质.在和谐对的条件下,分别确定了谱对形成的一些充分条件和必要条件.首先,给出了Strichartz谱对准则的几个等价形式.其次,得到了这个谱对成立的两个必要条件.最后,提供了Strichartz谱对准则的一个严格而详细的证明.     

右Clifford左商半群

本文讨论了右Ｃｌｉｆｆｏｒｄ左商半群．利用所谓的可适对刻划了右Ｃｌｉｆｆｏｒｄ半群中的左次半群,因此扩展了商半群的研究范围．     

On a Riemann–Hilbert problem for the Fokas–Lenells equation

The solution of the initial value problem (IVP) for the Fokas–Lenells equation (FLE) was constructed in terms of the solution $M(x,t,k)$ of a 2 $\times$ 2 matrix Riemann–Hilbert problem (RHP) as $k\to \infty$, and the one-soliton solution of the FLE was derived based on this Riemann–Hilbert problem, in Lenells and Fokas (2009). However, in fact, the derivative with respect to $x$ of the solution of the FLE ($u_x(x,t)$) was recovered from the RHP as $k\to \infty$. In this paper, we construct the solution of the FLE in terms of the RHP as $k\to 0$, because the Lax pair of the FLE contains the negative order of the spectral variable $k$. We show that the one-soliton solution of the FLE obtained in this paper is the same as Lenells and Fokas (2009), but avoiding a complex integral.     

Differentiation for Orders and Artinian Rings

The method of differentiation for the category -lat of lattices over an order will be extended to integral almost Abelian categories A instead of -lat. In particular, this yields a differentiation for finitely generated left modules over left Artinian rings.     

Left Adjoint for Booleanization

Left adjoint for Booleanization in suitable categories of frames is constructed.     

Comparability Invariance Results for Tolerance Orders

We prove comparability invariance results for three classes of ordered sets: bounded tolerance orders (equivalent to parallelogram orders), unit bitolerance orders (equivalent to point-core bitolerance orders) and unit tolerance orders (equivalent to 50% tolerance orders). Each proof uses a different technique and relies on the alternate characterization.     

On Stochastic Orders for Sums of Independent Random Variables

In this paper, it is shown that a convolution of uniform distributions (a) is more dispersed and (b) has a smaller hazard rate when the scale parameters of the uniform distributions are more dispersed in the sense of majorization. It is also shown that a convolution of gamma distributions with a common shape parameter greater than 1 is larger in (a) likelihood ratio order and (b) dispersive order when the scale parameters are more dispersed in the sense of majorization.     

Dualizing Modules for Orders and Artin Algebras

We provide a criterion for a -bimodule to be a dualizing module, where is an order over a commutative Gorenstein complete local domain of dim R=1. Using this criterion, we give examples of dualizing modules which are neither isomorphic to nor a dual of . Thus we can also give such examples over an Artin algebra by modulo a nonzerodivisor.     

Left, right, and inner socles of associative systems

We investigate the basic properties of the different socles that can be considered in not necessarily semiprime associative systems. Among other things, we show that the socle defined as the sum of minimal (or minimal and trivial) inner ideals is always an ideal. When trivial inner ideals are included, this inner socle contains the socles defined in terms of minimal left or right ideals. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Loopless Algorithm for Generation of Basic Minimal Interval Orders

Erhlich introduced the concept of generating combinatorial structures in constant time per generated item. Such algorithms are called loopless and have been described for many objects. Myers introduced the idea of a basic minimal interval order. This paper presents a loopless algorithm for generating basic minimal interval orders.