一类平面三次拟齐次向量场的全局拓扑结构

利用中心投影变换的思想证明一类平面三次拟齐次向量场的几何性质依赖于它的切向量场和诱导向量场.讨论了该系统的拓扑结构,并进行了分类;证明了该系统具有25类不同类的拓扑结构相图.     

Topological sensitivity analysis of a multi‐scale constitutive model considering a cracked microstructure

This paper deals with the sensitivity analysis of the macroscopic elasticity tensor to topological microstructural changes of the underlying material. In particular, the microstucture is topologicaly perturbed by the nucleation of a small circular inclusion. The derivation of the proposed sensitivity relies on the concept of topological derivative, applied within a variational multi‐scale constitutive framework where the macroscopic strain and stress at each point of the macroscopic continuum are defined as volume averages of their microscopic counterparts over a representative volume element (RVE) of material associated with that point. We consider that the RVE can contain a number of voids, inclusions and/or cracks. It is assumed that non‐penetration conditions are imposed at the crack faces, which do not allow the opposite crack faces to penetrate each other. The derived sensitivity leads to a symmetric fourth‐order tensor field over the unperturbed RVE domain, which measures how the macroscopic elasticity parameters estimated within the multi‐scale framework changes when a small circular inclusion is introduced at the micro‐scale level. Copyright © 2009 John Wiley & Sons, Ltd.     

L—Fuzzy拓扑空间中的可数F紧性与几乎可数F紧性

本文在Ｌ－ｕｚｚｙ拓扑空间中引入可数Ｆ紧性与几乎可数Ｆ紧性的概念，并讨论了它们的性质及其相互关系。     

Stochastic flows on a countable set: Convergence in distribution

Consider a sequenceF ₁,F ₂,... of i.i.d. random transformations from a countable setV toV. Such a sequence describes a discrete-time stochastic flow onV, in which the position at timen of a particle that started at sitex isM _n(x), whereM _n =F _n F _n–1 F ₁. We give conditions on the law ofF ₁ for the sequence (M _n) to be tight, and describe the possible limiting law. an example called the block charge model is introduced. The results can be formulated as a statement about the convergence in distribution of products of infinite-dimensional random stochastic matrices. In practical terms, they describe the possible equilibria for random motions of systems of particles on a countable set, without births or deaths, where each site may be occupied by any number of particles, and all particles at a particular site move together.     

H—空间的覆盖性质及其应用

我们得到了Ｈ－空间闭（开）覆盖性质的几个定理，改进和推广了Ｓｐｅｒｎｅｒ，Ｋｌｅｅ，Ａｌｅｘａｎｄｒｏｆｆ－Ｐａｓｙｎｋｏｆｆ，Ｂｅｒｇｅ，Ｇｈｏｕｉｌａ－Ｈｏｕｒｉ，Ｄａｎｚｅｒ－Ｇｒｕｎｂａｕｍ－Ｋｌｅｅ，Ｋｙ Ｆａｎ，ｓｈｉｈ－Ｔａｎ，Ｈｏｒｖａｔｈ和Ｌａｓｓｏｎｄｅ等人的相应结果。作为应用，我们对ｌ．ｃ．－空间内的下半连续集值映象证明了一个几站不动点定理并且推广吉洪诺夫不动点定理到ｌ．ｃ．     

Correlation Functions and Boundary Conditions in Rational Conformal Field Theory and Three-Dimensional Topology

We give a general construction of correlation functions in rational conformal field theory on a possibly nonorientable surface with boundary in terms of three-dimensional topological field theory. The construction applies to any modular category in the sense of Turaev. It is proved that these correlation functions obey modular invariance and factorization rules. Structure constants are calculated and expressed in terms of the data of the modular category.     

有叶顶间隙的涡轮弯叶栅拓扑与旋涡结构(Ⅱ)——横截面流场拓扑结构与叶栅旋涡结构

根据具有叶顶间隙的直叶栅和正、反弯叶栅壁面流动的墨迹显示以及横截面内气动参数测量,应用拓扑学原理,分析了叶栅流道横截面内的拓扑结构。与直叶栅比较,叶片正弯消除了上通道涡分离线,并使二次涡由闭式分离转变为开式分离,而叶片反弯仅影响奇点位置、旋涡强度与尺度。     

Weak Factorization Systems and Topological Functors

Weak factorization systems, important in homotopy theory, are related to injective objects in comma-categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cofibrantly generated. We also present a weak factorization system on the category of posets which is not cofibrantly generated. No such weak factorization systems were known until recently. This answers an open problem posed by M. Hovey.     

Loopless Generation of Linear Extensions of a Poset

Canfield and Williamson gave the first loopless algorithm for generating all linear extensions of a poset. It elegantly generates all signed extensions, resulting in each extension appearing somewhere with each sign, but retains only every other one independent of its sign. It uses an array for the extension. In this paper we give another loopless algorithm for generating all the linear extensions. It generates each extension only once and uses a list for the extensions.     

A relation for general and inverse semigroups

The relation in the title is S defined by