强ρ-正则半群上的最小正则*-半群同余

主要研究了强P-正则半群S(P)上的最小正则*-半群同余.利用S(P)的正则*-断面S°得到S(P)上最小正则*-半群同余的简单形式γP·由于S(P)/γp同构于S°,实质上S°是S(P)的最大正则*-半群同态象,且S(P)的正则*-断面不唯一,但从同意义上看正则*-断面唯一.     

正则半群的一个定理到拟正则半群的推广

1973年,T.E.Hall 证明了:“若正则半群 S 的每个(?)-类最多只含 m(一固定正整数)个(?)-类,则对 S 的任元 a,a~m 在 S 的子群中.”本文将该定理推广到拟正则半群上,即证明了:“若拟正则半群 S 的每个正则(?)-类最多只含m(一固定正整数)个(?)-类,则对 S 的任元 a,a~(mn)在 S 的子群中,其中 n 为 a~m的正则指数.”     

全正则子半群构成链的正则半群(英文)

本文考虑全正则子半群构成链的正则半群,得到了正则半群具有全正则子半群构成链的一个充分必要条件,这推广了Jones关于具有全正则子半群构成链的逆半群的结果.特别地,建立了具有全正则子半群构成链的完全0-单半群的结构.     

具有拟理想正则*-断面的正则半群

本文提出了具有正则*-断面正则半群的概念，所给出的例子表明具有拟理想正则*-断面的正则半群类真包含了具有拟理想逆断面的正则半群类和正则*-半群类；最后刻画了具有拟理想正则*-断面的正则半群的结构．     

强P-正则半群上的最小正则＊-半群同余

主要研究了强P-正则半群S（P）上的最小正则＊-半群同余.利用S（P）的正则＊-断面S°得到S（P）上最小正则＊-半群同余的简单形式γP.由于S（P）/γP同构于S°,实质上S°是S（P）的最大正则＊-半群同态象,且S（P）的正则＊-断面不唯一,但从同意义上看正则＊-断面唯一.     

带正则*-断面的正则半群

本文给出了带正则*-断面的正则半群的若干性质,获得了带拟理想正则*-断面的正则半群的一个构造方法.利用这一构造定理,考虑了这类半群上的同余.     

具有正则*-断面的正则半群的结构

设S是一个正则半群,如果存在一个S的子半群S~*及上的一元运算*满足条件：(1)(?)x∈S,x~*∈S~*∩V(x)；(2)(?)x∈S~*,(x~*)~*=x；(3)(?)x,y∈S,(x~*y)~*=y~*x~(**),(xy~*)~*=y~(xx)x~*则称S~*是S的一个正则*_-断面．本文刻画了具有正则*_-断面的正则半群的结构。     

非汉字符号~*-覆盖正则半群的构造(Ⅰ)

本文刻画了■*-覆盖正则半群的结构,得到了弱覆盖正则半群和覆盖正则半 群的分类.作为其主要结论的应用, 我们还得到了(？)-覆盖完全正则半群, 弱覆盖完 全正则半群和覆盖完全正则半群的结构刻画.     

E-理想拟正则半群

本文定义了一类拟正则半群,所谓E-理想拟正则半群;给出了它以及它的两类特殊情形(E-左正则性拟正则半群,E-半格性拟正则半群)的特征;建立了它们的结构定理,并作为推论获得了左正则带的结构以及带的已知结构(文献[1],Petrich,1967)。     

正则*-断面的一个分类(英文)

本文从(2,1)-代数簇的角度对具有正则*-断面的正则半群进行研究,给出了该簇及其若干子簇的一些刻画.事实上,本文给出了正则*-断面的一个分类.     

Determining a Rotation of a Tetrahedron from a Projection

The following problem, arising from medical imaging, is addressed: Suppose that T is a known tetrahedron in ?³ with centroid at the origin. Also known is the orthogonal projection U of the vertices of the image ?T of T under an unknown rotation ? about the origin. Under what circumstances can ? be determined from T and U?     

On a mapping of a projective space into a sphere

We obtain an exact estimate for the minimum multiplicity of a continuous finite-to-one mapping of a projective space into a sphere for all dimensions. For finite-to-one mappings of a projective space into a Euclidean space, we obtain an exact estimate for this multiplicity for n = 2, 3. For n ≥ 4, we prove that this estimate does not exceed 4. Several open questions are formulated.     

Calculating a function of a matrix with a real spectrum

Let T be a square matrix with a real spectrum, and let f be an analytic function. The problem of the approximate calculation of f(T) is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that T is triangular and its diagonal entries t_ii are arranged in increasing order. To avoid calculations using the differences t_ii ? t_jj with close (including equal) t_ii and t_jj, it is proposed to represent T in a block form and calculate the two main block diagonals using interpolating polynomials. The rest of the f(T) entries can be calculated using the Parlett recurrence algorithm. It is also proposed to perform some scalar operations (such as the building of interpolating polynomials) with an enlarged number of significant decimal digits.

     

Evolution to a steady state for a rarefied gas flowing from a tank into a vacuum through a plane channel

A kinetic equation (S-model) is used to solve the nonstationary problem of a monatomic rarefied gas flowing from a tank of infinite capacity into a vacuum through a long plane channel. Initially, the gas is at rest and is separated from the vacuum by a barrier. The temperature of the channel walls is kept constant. The flow is found to evolve to a steady state. The time required for reaching a steady state is examined depending on the channel length and the degree of gas rarefaction. The kinetic equation is solved numerically by applying a conservative explicit finite-difference scheme that is firstorder accurate in time and second-order accurate in space. An approximate law is proposed for the asymptotic behavior of the solution at long times when the evolution to a steady state becomes a diffusion process.