The π-π-theorem for manifold pairs with boundaries

The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L _*(π ₁(Y) → π ₁(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π ₁(X) ? π ₁(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP _* for manifold pairs and splitting obstruction groups LS _*. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.     

Algorithms for finding proper essential surfaces in 3-manifolds

In this paper, we present an algorithm which, for a given compact orientable irreducible boundary irreducible 3-manifold M, verifies whether M contains an essential orientable surface (possibly, with boundary), whose genus is at most N. The algorithm is based on Haken’s theory of normal surfaces, and on a trick suggested by Jaco and consisting in estimating the mean length of boundary curves in an unknown essential surface of a given genus in the given manifold.     

Lp-based combinatorial problem solving

A tutorial outline of the polyhedral theory that underlies linear programming (LP)-based combinatorial problem solving is given. Design aspects of a combinatorial problem solver are discussed in general terms. Three computational studies in combinatorial problem solving using the polyhedral theory developed in the past fifteen years are surveyed: one addresses the symmetric traveling salesman problem, another the optimal triangulation of input/output matrices, and the third the optimization of large-scale zero-one linear programming problems.     

Computing a Minimum Weight Triangulation of a Sparse Point Set*

Investigating the minimum weight triangulation of a point set with constraint is an important approach for seeking the ultimate solution of the minimum weight triangulation problem. In this paper, we consider the minimum weight triangulation of a sparse point set, and present an O(n ⁴) algorithm to compute a triangulation of such a set. The property of sparse point set can be converted into a new sufficient condition for finding subgraphs of the minimum weight triangulation. A special point set is exhibited to show that our new subgraph of minimum weight triangulation cannot be found by any currently known methods.     

激光三角法测量中被测物表面特性对测量精度影响的分析

激光三角法测量是现代测量技术中重要的测量方法,但其测量精度受自身系统、环境以及被测物表面特征等因素的影响。针对被测表面的特性是激光三角法产生测量中产生测量误差的主要因素,根据特定颜色所造成误差的重复特性提出了数据标定的改进方法;针对表面粗糙度,通过在光路适当位置安装偏振片有效消除了镜面反射,采用双光路设计有效改善了被测物倾斜带来的误差。最后通过实验验证了改进方法的有效性。     

EPR‐Based Approach for the Localization of Paramagnetic Metal Ions in Biomolecules

Metal ions play an important role in the catalysis and folding of proteins and oligonucleotides. Their localization within the three‐dimensional fold of such biomolecules is therefore an important goal in understanding structure–function relationships. A trilateration approach for the localization of metal ions by means of long‐range distance measurements based on electron paramagnetic resonance (EPR) is introduced. The approach is tested on the Cu²⁺ center of azurin, and factors affecting the precision of the method are discussed.     

Geodesic ideal triangulations exist virtually

It is shown that every non-compact hyperbolic manifold of finite volume has a finite cover admitting a geodesic ideal triangulation. Also, every hyperbolic manifold of finite volume with non-empty, totally geodesic boundary has a finite regular cover which has a geodesic partially truncated triangulation. The proofs use an extension of a result due to Long and Niblo concerning the separability of peripheral subgroups.

     

用激光三角法重构混凝土断裂面三维轮廓与断裂能分析

采用基于激光三角法的测试方法对混凝土断面表面轮廓进行了三维重构,初步的断面分析结果表明,相对于传统断面分析方法,本试验方法实现了断面的无损、快速和准确的测量分析,在测量到的断面基础上,给出了本试验所得到的混凝土材料断裂能与分维的关系。     

Generating even triangulations of the projective plane

We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of even‐splittings and attaching octahedra, both of which were first given by Batagelj 2 . © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 333–349, 2007     

Pathwidth of outerplanar graphs

We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected outerplanar graph is at most c plus the pathwidth of its dual. They also conjectured that this was actually true with c being one for every biconnected planar graph. Fomin [10] proved that the second conjecture is true for all planar triangulations. First, we construct for each p ≥ 1, a biconnected outerplanar graph of pathwidth 2p + 1 whose (geometric) dual has pathwidth p + 1, thereby disproving both conjectures. Next, we also disprove two other conjectures (one of Bodlaender and Fomin [3], implied by one of Fomin [10]. Finally we prove, in an algorithmic way, that the pathwidth of every biconnected outerplanar graph is at most twice the pathwidth of its (geometric) dual minus one. A tight interval for the studied relation is therefore obtained, and we show that all cases in the interval happen. © 2006 Wiley Periodicals, Inc. J Graph Theory 55: 27–41, 2007