像空间为$l^1$的单位球面上的等距延拓问题

The main result of this paper is to prove Fang and Wang＇s result by another method： Let E be any normed linear space and Vo ： S（E）→ S（l^1） be a surjective isometry. Then V0 can be linearly isometrically extended to E.     

可拓学在管理领域中的应用研究进展

管理的过程就是通过开拓创新处理矛盾问题的过程.可拓学就是这样一门学科,它用形式化的模型研究事物拓展的可能性和开拓创新的规律与方法,并用于解决矛盾问题.对可拓学在管理领域中的应用研究进行了回顾,分析了应用研究的特点.提出了可拓学在"冲突管理"、"系统思考"和"复杂系统管理"中应用的前景.     

可拓数据挖掘研究进展

可拓学研究用形式化模型解决矛盾问题的理论与方法,可拓数据挖掘是可拓学和数据挖掘结合的产物,它探讨利用可拓学方法和数据挖掘技术,去挖掘数据库中与可拓变换有关的知识,包括可拓分类知识、传导知识等可拓知识.随着经济全球化的推进,环境的多变促使了信息和知识的更新周期缩短,创新和解决矛盾问题越来越成为各行各业的重要工作.因此,如何挖掘可拓知识就成为数据挖掘研究的重要任务.研究表明,可拓数据挖掘将具有广阔的应用前景.将介绍可拓数据挖掘的集合论基础、基本知识和目前研究的主要内容,并提出今后需要进一步探讨的问题及其发展前景.     

解决矛盾问题的可拓模型与可拓知识的研究

可拓学是解决矛盾问题的学科,在可拓学的可拓模型原型的基础上,明确了计算机解决矛盾问题的可拓模型,它包括三部分:关联函数、可拓知识和推理算法,其中关联函数和可拓知识对不同的问题需要利用不同的原理,且它们是逐步变化的.在可拓知识中,关联函数的可拓变换需要通过计算证明其值是逐步增加的.这样,矛盾问题在计算机中才能得到解决.本文通过多个实例来说明解决矛盾问题的可拓模型及可拓知识的建立和实现.     

One-point extensions of generalized hexagons and octagons

In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite generalized hexagon of classical order, different from the one of order 2, and of the known finite generalized octagons provided the following property holds: for any three points x, y and z of S, the graph-theoretic distance from y to z in the derived generalized hexagon S_x is the same as the distance from x to z in S_y.     

Browder-Weyl theorems, tensor products and multiplications

A Banach space operator T∈B(X) satisfies Browder's theorem if the complement of the Weyl spectrum σw(T) of T in σ(T) equals the set of Riesz points of T; T is polaroid if the isolated points of σ(T) are poles (no restriction on rank) of the resolvent of T. Let Φ(T) denote the set of Fredholm points of T. Browder's theorem transfers from A,B∈B(X) to S=LARB (resp., S=A⊗B) if and only if A and B^∗ (resp., A and B) have SVEP at points μ∈Φ(A) and ν∈Φ(B) for which λ=μν∉σw(S). If A and B are finitely polaroid, then the polaroid property transfers from A∈B(X) and B∈B(Y) to LARB; again, restricting ourselves to the completion of X⊗Y in the projective topology, if A and B are finitely polaroid, then the polaroid property transfers from A∈B(X) and B∈B(Y) to A⊗B.     

拟三角Hopf代数的Ore -扩张

该文主要考虑了拟三角Hopf代数的某种Ore -扩张问题. 对拟三角Hopf代数的Ore -扩张何时保持相同的拟三角结构给出了充分必要条件. 最后作为应用, 文章讨论了Sweedler Hopf代数和Lusztig小量子群的Ore -扩张结构.     

Continuous mappings on subspaces of products with the κ-box topology

Much of General Topology addresses this issue: Given a function fC(Y,Z) with YY^′ and ZZ^′, find , or at least , such that ; sometimes Z=Z^′ is demanded. In this spirit the authors prove several quite general theorems in the context Y^′=(X_I)_κ=∏_iIX_i in the κ-box topology (that is, with basic open sets of the form ∏_iIU_i with U_i open in X_i and with U_i≠X_i for <κ-many iI). A representative sample result, extending to the κ-box topology some results of Comfort and Negrepontis, of Noble and Ulmer, and of Hušek, is this. Theorem Let ωκα (that means: κ<α, and [β<α and λ<κ]β^λ<α) with α regular, be a set of non-empty spaces with each d(X_i)<α, π[Y]=X_J for each non-empty JI such that |J|<α, and the diagonal in Z be the intersection of <α-many regular-closed subsets of Z×Z. Then (a) Y is pseudo-(α,α)-compact, (b) for every fC(Y,Z) there is J[I]^<α such that f(x)=f(y) whenever x_J=y_J, and (c) every such f extends to .     

Bruck–Reilly extensions of direct products of monoids and completely (0-)simple semigroups

We say that a class of monoids satisfies the property ℘ if every monoid in that class that admits a finitely presented Bruck–Reilly extension is finitely generated. We show that completely (0-)simple semigroups satisfy ℘, and that the direct product of two monoids in a class that satisfy ℘ also satisfies ℘ subject to a certain condition on the endomorphisms of the direct product. As a consequence of this result we obtain a new class of bands and a new class of completely regular semigroups that satisfy property ℘.     

On a relative uniform completion of an archimedean lattice ordered group

The notion of a relatively uniform convergence (ru-convergence) has been used first in vector lattices and then in Archimedean lattice ordered groups. Let G be an Archimedean lattice ordered group. In the present paper, a relative uniform completion (ru-completion) of G is dealt with. It is known that exists and it is uniquely determined up to isomorphisms over G. The ru-completion of a finite direct product and of a completely subdirect product are established. We examine also whether certain properties of G remain valid in . Finally, we are interested in the existence of a greatest convex l-subgroup of G, which is complete with respect to ru-convergence. This work was supported by Science and Technology Assistance Agency under the contract No. APVT-20-004104. Supported by Grant VEGA 1/3003/06.