三维不可压缩Euler方程的H1(R~3)轴对称解

在适当的初值条件下，对三维不可压缩Ｅｕｌｅｒ方程组，我们证明了Ｈ１（Ｒ３）轴对称解的存在性．     

Commutativity for a Certain Class of Rings

We first establish the commutativity for the semiprime ring satisfying [x ⁿ , y]x ^r = ±y ^s[x, y ^m]y ^t for all x, y in R, where m, n, r, s, and t are fixed non-negative integers, and further, we investigate the commutativity of rings with unity under some additional hypotheses. Moreover, it is also shown that the above result is true for s-unital rings. Also, we provide some counterexamples which show that the hypotheses of our theorems are not altogether superfluous. The results of this paper generalize some of the well-known commutativity theorems for rings which are right s-unital.     

T拟内射模与TQI环

本文定义并刻划了Ｔ拟内射模与Ｔ拟内射包，证明了ＷＧ－ｃｏｃｒｉｔｉｃａｌＴ拟内射模的自同态环为正则非奇异右自内射环．最后讨论了Ｔ拟内射模与Ｔ内射模一致的环，即ＴＱＩ环．还给出了Ｇａｂｒｉｅｌ拓扑Ｇ中每个右理想Ｔ拟内射的几个等价条件     

Factorization in generalized power series

The field of generalized power series with real coefficients and exponents in an ordered abelian divisible group is a classical tool in the study of real closed fields. We prove the existence of irreducible elements in the ring consisting of the generalized power series with non-positive exponents. The following candidate for such an irreducible series was given by Conway (1976): . Gonshor (1986) studied the question of the existence of irreducible elements and obtained necessary conditions for a series to be irreducible. We show that Conway's series is indeed irreducible. Our results are based on a new kind of valuation taking ordinal numbers as values. If we can give the following test for irreducibility based only on the order type of the support of the series: if the order type is either or of the form and the series is not divisible by any monomial, then it is irreducible. To handle the general case we use a suggestion of
M.-H. Mourgues, based on an idea of Gonshor, which allows us to reduce to the special case . In the final part of the paper we study the irreducibility of series with finite support.

     

Trees and valuation rings

A subring of a division algebra is called a valuation ring of if or holds for all nonzero in . The set of all valuation rings of is a partially ordered set with respect to inclusion, having as its maximal element. As a graph is a rooted tree (called the valuation tree of ), and in contrast to the commutative case, may have finitely many but more than one vertices. This paper is mainly concerned with the question of whether each finite, rooted tree can be realized as a valuation tree of a division algebra , and one main result here is a positive answer to this question where can be chosen as a quaternion division algebra over a commutative field.

     

Commutativity of rings through a Streb's result

In this paper we investigate commutativity of rings with unity satisfying any one of the properties:

可换环上辛代数与一般线性李代数之间的中间李代数

本文研究了含幺可换环上一般线性李代数的子代数结构.通过构造特殊矩阵并利用这些矩阵进行计算, 得到了任意含幺可换环上辛代数与一般线性李代数之间的所有中间李代数的形式.并且有利于研究可换环上相应的典型群的子群结构.     

可换环上Abel李代数的全形的导子和自同构

决定了可换环上Abel李代数的全形的导子代数和自同构群.     

On the existence of Burgers vortices for high Reynolds numbers

Axisymmetric or non-axisymmetric Burgers vortices have been studied numerically as a model of concentrated vorticity fields. Recently it has been rigorously proved that non-axisymmetric Burgers vortices exist for all values of the vortex Reynolds number if an asymmetry parameter is sufficiently small. On the other hand, several numerical results indicate that Burgers vortices have simpler structures as the vortex Reynolds number is increasing, even when the asymmetry parameter is not sufficiently small. In this paper we give a rigorous explanation for this numerical observation and extend the existence and stability results of Burgers vortices for high vortex Reynolds numbers.     

Efficient algorithms for wavelength assignment on trees of rings

A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths with the same wavelength are edge-disjoint, using the minimum number of wavelengths. The WA problem is NP-hard for a tree of rings network which is well used in practice. In this paper, we give an efficient algorithm which solves the WA problem on a tree of rings with an arbitrary (node) degree using at most 3L wavelengths and achieves an approximation ratio of 2.75 asymptotically, where L is the maximum number of paths on any link in the network. The 3L upper bound is tight since there are instances of the WA problem that require 3L wavelengths even on a tree of rings with degree four. We also give a 3L and 2-approximation (resp. 2.5-approximation) algorithm for the WA problem on a tree of rings with degree at most six (resp. eight). Previous results include: 4L (resp. 3L) wavelengths for trees of rings with arbitrary degrees (resp. degree at most eight), and 2-approximation (resp. 2.5-approximation) algorithm for trees of rings with degree four (resp. six).