Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

High pressure X-ray diffraction study of CdAl2Se4 and Raman study of AAl2Se4 (A=Hg, Zn) and CdAl2X4 (X=Se, S)

We report the results of an X-ray diffraction study of CdAl₂Se₄ and of Raman studies of HgAl₂Se₄ and ZnAl₂Se₄ at room temperature, and of CdAl₂S₄ and CdAl₂Se₄ at 80 K at high pressure. The ambient pressure phase of CdAl₂Se₄ is stable up to a pressure of 9.1 GPa above which a phase transition to a disordered rock salt phase is observed. A fit of the volume pressure data to a Birch-Murnaghan type equation of state yields a bulk modulus of 52.1 GPa. The relative volume change at the phase transition at ∼9 GPa is about 10%. The analysis of the Raman data of HgAl₂Se₄ and ZnAl₂Se₄ reveals a general trend observed for different defect chalcopyrite materials. The line widths of the Raman peaks change at intermediate pressures between 4 and 6 GPa as an indication of the pressure induced two stage order-disorder transition observed in these materials. In addition, we include results of a low temperature Raman study of CdAl₂S₄ and CdAl₂Se₄, which shows a very weak temperature dependence of the Raman-active phonon modes.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

On one generalization of a DiPerna and Majda theorem

The weak limits of sequences {f(u^ν)}_ν∈? where u^ν's are vector‐valued µ‐measurable functions defined on a compact set Ω and f is (possibly) discontinuous are investigated. As shown by the author (J. Conv. Anal. (to appear)), they are described in terms of integral formulae involving parametrized measures independent of f, similarly as in the classical theorem by Young and its generalization due to DiPerna and Majda. In the present paper we describe the supports of the involved parametrized measures. Copyright © 2006 John Wiley & Sons, Ltd.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Three New Polyoxygenated Steroids from Two Species of the South China Sea Gorgonian Muricella flexuosa and Menella verrucosa Brundin

Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.     

Asymmetric synthesis of homo-apioneplanocin A from d-ribose

Homo-apioneplanocin A was efficiently synthesized via stereoselective hydroxymethylation, regio- and chemoselective hydroboration, and chemoselective oxidation as key steps from d-ribose.