Countability and star covering properties

Whenever P is a topological property, we say that a topological space is star P if whenever U is an open cover of X, there is a subspace A subset of X with property P such that X = St(A, U). We study the relationships of star P properties for P is an element of {Lindelof, sigma-compact, countable} with other Lindelof type properties. (C) 2010 Elsevier B.V. All rights reserved.

Quantification of enantiomeric excess by H-1-detected heteronuclear refocusing and homonuclear multiple quantum NMR experiments

The omega(1)-heterodecoupled-C-13-filtered proton detected NMR experiments are reported for the accurate quantification of enantiomeric excess in chiral molecules embedded in chiral liquid crystal. The differential values of both H-1-H-1 and C-13-H-1 dipolar couplings in the direct dimension and only H-1-H-1 dipolar couplings in the indirect dimension enable unraveling of overlapped enantiomeric peaks. The creation of unequal C-13-bound proton signal for each enantiomer in the INEPT block and non-uniform excitation of coherences in homonuclear multiple quantum experiments do not yield accurate quantification of enantiomeric excess. In circumventing these difficulties, a coupling dependent intensity correction factor has been invoked. (C) 2010 Elsevier B.V. All rights reserved.

HFD groups in the Solovay model

Hajnal and Juhasz proved that under CH there is a hereditarily separable, hereditarily normal topological group without non-trivial convergent sequences that is countably compact and not Lindelof. The example constructed is a topological subgroup H subset of 2(omega 1) that is an HFD with the following property (P) the projection of H onto every partial product 2(I) for I is an element of vertical bar omega(1)vertical bar(omega) is onto. Any such group has the necessary properties. We prove that if kappa is a cardinal of uncountable cofinality, then in the model obtained by forcing over a model of CH with the measure algebra on 2(kappa), there is an HFD topological group in 2(omega 1) which has property (P). Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.

On the extent of star countable spaces

For a topological property P, we say that a space X is star Pif for every open cover Uof the space X there exists Y aS, X such that St(Y,U) = X and Y has P. We consider star countable and star Lindelof spaces establishing, among other things, that there exists first countable pseudocompact spaces which are not star Lindelof. We also describe some classes of spaces in which star countability is equivalent to countable extent and show that a star countable space with a dense sigma-compact subspace can have arbitrary extent. It is proved that for any omega (1)-monolithic compact space X, if C (p) (X)is star countable then it is Lindelof.

Calibration of the channel that determines the omega-hydroxylation regiospecificity of cytochrome P4504A1 - Catalytic oxidation of 12-halododecanoic acids

The fatty acid omega-hydroxylation regiospecificity of CYP4 enzymes may result from presentation of the terminal carbon to the oxidizing species via a narrow channel that restricts access to the other carbon atoms. To test this hypothesis, the oxidation of 12-iodo-, 12-bromo-, and 12-chlorododecanoic acids by recombinant CYP4A1 has been examined. Although all three 12-halododecanoic acids bind to CYP4A1 with similar dissociation constants, the 12-chloro and 12-bromo fatty acids are oxidized to 12-hydroxydodecanoic acid and 12-oxododecanoic acid, whereas the 12-iodo analogue is very poorly oxidized. Incubations in (H2O)-O-18 show that the 12-hydroxydodecanoic acid oxygen derives from water, whereas that in the aldehyde derives from O-2. The alcohol thus arises from oxidation of the halide to an oxohalonium species that is hydrolyzed by water, whereas the aldehyde arises by a conventional carbon hydroxylation-elimination mechanism. No irreversible inactivation of CYP4A1 is observed during 12-halododecanoic acid oxidation. Control experiments show that CYP2E1, which has an omega-1 regiospecificity, primarily oxidizes 12-halododecanoic acids to the omega-aldehyde rather than alcohol product. Incubation of CYP4A1 with 12,12-[H-2](2)-12-chlorododecanoic acid causes a 2-3-fold increase in halogen versus carbon oxidation. The fact that the order of substrate oxidation (Br > Cl >> I) approximates the inverse of the intrinsic oxidizability of the halogen atoms is consistent with presentation of the halide terminus via a channel that accommodates the chloride and bromide but not iodide atoms, which implies an effective channel diameter greater than 3.90 angstrom but smaller than 4.30 angstrom.

Increasing ionic conductivity and mechanical strength of a plastic electrolyte by inclusion of a polymer

in this contribution we present a soft matter solid electrolyte which was obtained by inclusion of a polymer (polyacrylonitrile, PAN) in LiClO4/LiTFSI-succinonitrile (SN), a semi-solid organic plastic electrolyte. Addition of the polymer resulted in considerable enhancement in ionic conductivity as well as mechanical strength of LiX-SN (X=ClO4, TFSI) plastic electrolyte. Ionic conductivity of 92.5%-[1 M LiClO4-SN]:7.5%-PAN (PAN amount as per SN weight) composite at 25 degrees C recorded a remarkably high value of 7 x 10(-3) Omega(-1) cm(-1), higher by few tens of order in magnitude compared to 1 M LiClO4-SN. Composite conductivity at sub-ambient temperature is also quite high. At -20 degrees C, the ionic conductivity of (100 -x)%-[1 M LiClO4-SN]:x%-PAN composites are in the range 3 x 10(-5)-4.5 x 10(-4) Omega(-1) cm(-1), approximately one to two orders of magnitude higher with respect to 1 M LiClO4-SN electrolyte conductivity. Addition of PAN resulted in an increase of the Young's modulus (Y) from Y -> 0 for LiClO4-SN to a maximum of 0.4MPa for the composites. Microstructural studies based on X-ray diffraction, differential scanning calorimetry and Fourier transform infrared spectroscopy suggest that enhancement in composite ionic conductivity is a combined effect of decrease in crystallinity and enhanced trans conformer concentration. (c) 2008 Elsevier Ltd. All rights reserved.

The Linear Tripeptide L-Alanylglyeyl-L- alanine

L-Alanylglycyl-L-alanine, C8H15N3O4, exists as zwitter-ion in the crystal with the N terminus protonated and the C terminus in an ionized form, Both the peptide units are in trans configurations and deviate significantly from planarity. Backbone torsion angles are psi(1)=172.7(2), omega(1)=-178.2(2), phi(2)=91.7(2), phi(2)=-151.9(2), omega(2)=-176.9(2), phi(3)=-71.3(2), phi(31)=-7.0(3) and psi(32) 172.4(2)degrees. The protonated NH3+ group forms three hydrogen bonds with atoms of symmetry-related molecules.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Increasing ionic conductivity of polymer-sodium salt complex by addition of a non-ionic plastic crystal

Ionic conductivity and other physico-chemical properties of a soft matter composite electrolyte comprising of a polymer-sodium salt complex and a non-ionic plastic crystal are discussed here. The electrolyte under discussion comprises of polyethyleneoxide (PEO)-sodium triflate (NaCF3SO3) and succinonitrile (SN). Addition of SN to PEO-NaCF3SO3 resulted in significant enhancement in ionic conductivity. At 50% SN concentration (with respect to weight of polymer), the polymer-plastic composite electrolyte room temperature (= 25 degrees C) ionic conductivity was similar to 1.1 x 10(-4) Omega(-1) cm(-1), approximately 45 times higher than PEO-NaCF3SO3. Observations from ac-impedance spectroscopy along with X-ray diffraction, differential scanning calorimetry and Fourier transform inrared spectroscopy strongly suggest the enhancement in the composite is ionicconductivity due to enhanced ion mobility via decrease in crystallinity of PEO. The free standing composite polymer-plastic electrolytes were more compliable than PEO-NaCF3SO3 thus exhibiting no detrimental effects of succinonitrile addition on the mechanical stability of PEO-NaCF3SO3. We propose that the exploratory PEO-NaCF3SO3-SN system.discussed here will eventually be developed as a prototype electrolyte.for sodium-sulfur batteries capable of operating at ambient and.sub-ambient conditions. (C) 2010 Elsevier B.V. All rights reserved.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Controlled combustion synthesis and properties of fine-particle NASICON materials

Fine-particle NASICON materials, Na1+xZr2P3-xSixO12 (where x = 0.0, 0.5, 1.0, 1.5, 2.0 and 2.5), have been prepared by controlled combustion of an aqueous solution containing stoicthiometric amounts of sodium nitrate, zirconyl nitrate, ammonium perchlorate, diammonium hydrogen phosphate, fumed silica and carbonohydrazide. Formation of NASICON has been confirmed by powder XRD, Si-29 NMR and IR spectroscopy. These NASICON powders are fine (average agglomerate size 5-12 mum) with a surface area varying from 8 to 30 m2 g-1. NASICON powders pelletized and sintered at 1100-1200-degrees-C for 5 h achieved 90-95% theoretical density and show fine-grain microstructure. The coefficient of thermal expansion of sintered NASICON compact was measured up to 500-degrees-C and changes f rom -3.4 x 10(-6) to 4.1 x 10(-6) K-1. The conductivity of Sintered Na3Zr2PSi2O12 compact at 300-degrees-C is 0.236 OMEGA-1 cm-1.