Universal abelian covers of superisolated singularities

We give explicit examples of Gorenstein surface singularities with integral homology sphere link, which are not complete intersections. Their existence was shown by Luengo–Velasco, Melle–Hernández and Némethi, thereby providing counterexamples to the universal abelian covering conjecture of Neumann and Wahl (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fuzzy minimum weight edge covering problem

Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm.     

Crown reductions for the Minimum Weighted Vertex Cover problem

The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG’03), Lecture notes in computer science, vol. 2880, 2003, pp. 1-12, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69]. We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so-called strong crown reductions, suitable for finding (or counting) all minimum vertex covers, or finding a minimum vertex cover under some additional constraints. It is described how crown decompositions and strong crown decompositions suitable for such problems can be computed in polynomial time. For weighted König-Egerváry graphs (G,w) we observe that the set of vertices belonging to all minimum vertex covers, and the set of vertices belonging to no minimum vertex covers, can be efficiently computed.Further, for some specific classes of graphs, simple algorithms for the MIN-VC problem with a constant approximation factor r<2 are provided. On the other hand, we conclude that for the regular graphs, or for the Hamiltonian connected graphs, the problem is as hard to approximate as for general graphs.It is demonstrated how the results about strong crown reductions can be used to achieve a linear size problem kernel for some related vertex cover problems.     

罗尔中值定理的一些新证法(英文)

给出了罗尔微分中值定理的三种新的证明方法,其中第二种很简便的方法仅依赖于大家熟知的Heine-Borel有限覆盖定理.由此可见罗尔微分中值定理可以是实数的完备性的直接推论.     

作物残茬覆盖度遥感监测研究进展

作物残茬作为农田生态系统的重要组成部分,影响着农田生态系统中的营养物质、碳、水和能量的流动与循环。作物残茬覆盖度作为描述作物残茬数量和分布的重要指标,对于农田生态系统C循环和全球气候变化均有实际意义,具备重要的定量监测价值。遥感技术具有准确、经济、快速大面积监测的能力,因此利用遥感监测区域尺度的作物残茬覆盖度,受到国内外学者的关注。工作回顾总结了目前利用遥感监测作物残茬覆盖度的主要方法和最新研究进展,并根据基本方法的差异以及数据源的不同,从五个类别分别介绍了遥感监测原理与技术革新,对每一类方法的优点和缺陷进行分析,并提出了相应的改进措施。最后对作物残茬覆盖度遥感监测方法的发展趋势进行了展望。     

单形和3维立方体乘积上小覆盖的等变协边类的个数

本文研究了小覆盖的等变协边分类. 利用示性函数和Stong同态确定了单形和3维立方体乘积上小覆盖的等变协边类的个数, 推广了现有文献中的相关结果.     

相对n-FP-内射模

给出了n-FP-内射模的定义,M为左R-模,如果对任意的左R-模N有Ext1(N,M)=0,则称M为n-FP-内射模,作为应用,给出了n-FP-内射模的一些等价条件.     

关于中紧性的注记

本文利用良序单调复盖、内部保持复盖、次ｏｒｔｈｏ－紧及垫状加细等刻画了中紧性。其次，证明了空间是中紧的当且仅当它是中可膨胀的且具胡性质ｂ。它们分别改进了文献［１］、［２］的相应结果。     

Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5

An orthogonal double cover (ODC) of the complete graph K_n by a graph G is a collection = {G_i|i = 1,2, . . . ,n} of spanning subgraphs of K_n, all isomorphic to G, with the property that every edge of K_n belongs to exactly two members of and any two distinct members of share exactly one edge. A caterpillar of diameter five is a tree arising from a path with six vertices by attaching pendant vertices to some or each of its vertices of degree two. We show that for any caterpillar of diameter five there exists an ODC of the complete graph K_n.     

Torsions of 3-Dimensional Small Covers

In this paper,it is shown that for a 3-dimensional small cover M over a polytope P,there are only 2-torsions in H1(M;Z).Moreover,the mod 2 Betti number growth of finite covers of M is studied.