Coset extensions of <Emphasis Type=”Italic”>S</Emphasis>-sets

Summary Three weak variants of compactness which lie strictly between compactness and quasicompactness, are introduced. Their basic properties are studied. The interplay with mapping and their direct and inverse preservation under mappings are investigated. In the process three decompositions of compactness are observed.     

On topological properties of the Hartman-Mycielski functor

We investigate some topological properties of a normal functorH introduced earlier by Radul which is some functorial compactification of the Hartman-Mycielski construction HM. We prove that the pair (H X, HMY) is homeomorphic to the pair (Q, σ) for each nondegenerated metrizable compactumX and each denseσ-compact subsetY.     

聚醚醚酮链结构与反应的模型化合物的量子化学研究

利用ＡＭ１方法对聚醚醚酮模型化合物全优化，结果为：芳环平均相互扭转角为３３．０度，桥键角１１７．０－１１８．０度，其分子结构拓扑图形表明：所有苯环（核）为平面构型，但其内角扭曲；其氢原子对苯环构型无实质性贡献，在更长链的计算中，冻结苯核与氢原子也得出满意结果，根据Ｍｕｌｌｉｋｅｎ键序与电荷讨论了醚交换与磺化反应。     

FULL DISCRETE NONLINEAR GALERKIN METHOD FOR THE NAVIER-STOKES EQUATIONS

This paper deals with the inertial manifold and the approximate inertial manifold concepts of the Navier-Stokes equations with nonhomogeneous boundary conditions and inertial algorithm. Furtheremore, we provide the error estimates of the approximate solutions of the Navier-Stokes Equations.     

Calculus I: The first derivative of pseudoisotopy theory

Let P be the (stable, smooth) pseudoisotopy space of the space X. For any map Y: YX of spaces, we identify the homotopy type of the fiber of P(f): P(f) P(f) in a stable range, roughly twice the connectivity of the map YX. We establish some language for discussing and manipulating such stable-range relative calculations for any homotopy functor. The theorem about P has a corollary about Waldhausen's A. Dedicated to Alexander GrothendieckResearch supported in part by NSF grant DMS-8806444 and by a Sloan Fellowship. Research at MSRI supported in part by NSF grant DMS-8505550.     

On deformed preprojective algebras

Deformed preprojective algebras are generalizations of the usual preprojective algebras introduced by Crawley-Boevey and Holland, which have applications to Kleinian singularities, the Deligne-Simpson problem, integrable systems and noncommutative geometry. In this paper we offer three contributions to the study of such algebras: (1) the 2-Calabi-Yau property; (2) the unification of the reflection functors of Crawley-Boevey and Holland with reflection functors for the usual preprojective algebras; and (3) the classification of tilting ideals in 2-Calabi-Yau algebras, and especially in deformed preprojective algebras for extended Dynkin quivers.     

Analytic expression of the second derivatives of electronic energy for full configuration interaction wave functions

Summary A new analytic second derivative expression of the electronic energy is derived for full configuration interaction (CI) wave functions. This formula is shown to be free from the derivative terms of both CI and MO coefficients. The second-order relationships between CI and MO coefficients for full CI wave functions are also presented.     

Half Exact Functors Associated with Cotorsion Pairs on Exact Categories

In the previous article “Hearts of twin cotorsion pairs on exact categories. J. Algebra, 394, 245–284 (2013)”, we introduced the notion o     

Comparison of Multivariate Matching Methods: Structures,Distances, and Algorithms

Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.