公理化局部有限空间中映射连续性的扩展

用公理化方法研究了局部有限空间中的连续映射及其扩张问题。给出了局部有限空间的公理化定义方法;利用邻近关系研究了局部有限空间中的连续映射、同胚和局部同胚等问题;通过对局部有限空间变形的研究,定义了局部有限空间的一种特殊收缩核,有效地解决了局部有限空间中连续映射的扩张问题。     

Generating Quadratic Pseudo-Anosov Homeomorphisms of Closed Surfaces

In this note, we show that given a closed, orientable genus-g surface S _g , any hyperbolic toral automorphism has a positive power which induces a quadratic, orientable pseudo-Anosov homeomorphism on S _g . To show this, we lift Anosov toral automorphisms through a ramified topological covering and present the lifted homeomorphism via a standard set of Lickorish twists. This construction provides a general method of producing pseudo-Anosov maps of closed surfaces with predetermined orientable foliations and quadratic dilatation. Since these lifted automorphisms have orientable foliations, this construction is a sort of converse to that of Franks and Rykken [Trans. Amer. Math. Soc. 1999], who established that one can associate to a quadratic pseudo-Anosov homeomorphism with oriented unstable foliation a hyperbolic toral automorphism.     

周期摄动保守系统的存在性定理

本文利用全局反函数定理讨论了一类非线性边值问题解的存在性与唯一性.     

关于算子同胚映射

在算子开集理论中给出了算子同胚映射的概念,得到了算子同胚映射的若干性质.     

Slodkowski定理的Chirka证明的一些注解(英文)

通过在一个积分算子上运用Schauder不动点定理,Chirka对Slokowski的全纯运动扩张定理提供了一个优美的简单证明.本文中,作者对构造此证明的启发提供一个参考同时用此方法通过不同方式来构造全纯扩张.一个自然的问题是研究这些用不同方式得到的全纯扩张是否相同.因此对全纯扩张唯一性已有的判断法提供一个简单的综述.最后介绍在全纯扩张唯一性存在时的一个应用.     

吸引盆在二阶抛物线边值问题解存在唯一性中的应用

本文研究了二阶抛物线边值问题解的存在唯一性的问题.利用吸引盆的方法和全局同胚理论,推导出二阶抛物线边值问题解存在唯一性的一个充分条件,从而推广了已经存在的一些定理.     

A minimization version of a directed subgraph homeomorphism problem

We consider a special case of the directed subgraph homeomorphism or topological minor problem, where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this application domain, the task is to simultaneously schedule, bind and route a so-called data-flow graph, where vertices represent operations and arcs stand for data dependencies between the operations, given an orthogonal grid structure of reconfigurable processing elements (PEs) that have restricted communication abilities. We show that the problem of simultaneously scheduling, binding and routing is NP-complete by describing a logic engine reduction from NAE-3-SAT. This result holds even when the input graph is a directed tree with maximum indegree two. We also give a |V|^3/2-approximation algorithm. J. A. Brenner’s research supported by the DFG Research Center Matheon “Mathematics for key technologies”. J. C. van der Veen’s research supported by DFG Focus Program 1148, “Reconfigurable Architectures”, Grants FE 407/8-1 and FE 407/8-2.     

LF拓扑空间几乎可数性的性质

本文讨论了ＬＦ拓扑空间的几乎可数性在映射作用下的某些性质。     

关于两类函数的大范围同胚

基于微分方程与优化中解存在唯一性问题，对Ｌｉｐｓｃｈｉｔｚ函数类与弱一致单调函数的大范围同胚作了理论上的探讨．推广了一些Ｌｉｐｓｃｈｉｔｚ函数类已有文献的结果，给出了弱一致单调函数的定义以及几个大范围同胚的命题。