The a--> P phase transition of Tristearin (SSS) has been investigated both by Differential Scanning Calorimetry and Small Angle X-Ray Diffraction as a function of temperature at the same heating rate ( 2 deglmin ) in order to elucidate either this transition occurs in the solid state or is melt mediated. INTRODUCTION iriglycerides display a complex monotropic polymorphism. They frequently exhib...

The wavefields generated by monopole and dipole sources in a fluid filled borehole embedded in multilayered transversely isotropic saturated porous formations are studied. The layers are modeled following Biot theory modified in accordance with homogenization theory. It allows to take into account a transversely isotropic skeleton and/or a transversely isotropic complex permeability tensor. The...

For a fixed graph H, a graph G is uniquely H-saturated if G does not contain H, but the addition of any edge from G to G completes exactly one copy of H. Using a combination of algebraic methods and counting arguments, we determine all the uniquely C4-saturated graphs; there are only ten of them.

An n-by-n bipartite graph is H-saturated if the addition of any missing edge between its two parts creates a new copy of H. In 1964, Erdős, Hajnal and Moon made a conjecture on the minimum number of edges in a Ks,s-saturated bipartite graph. This conjecture was proved independently by Wessel and Bollobás in a more general, but ordered, setting: they showed that the minimum number of edges in a ...

We prove a structural property of the class of unconditionally saturated separable Banach spaces. We show, in particular, that for every analytic set A, in the Effros-Borel space of subspaces of C[0, 1], of unconditionally saturated separable Banach spaces, there exists an unconditionally saturated Banach space Y , with a Schauder basis, that contains isomorphic copies of every space X in the c...

A graph is C5-saturated if it has no five-cycle as a subgraph, but does contain a C5 after the addition of any new edge. Extending our previous result, we prove that the minimum number of edges in a C5-saturated graph on n vertices is sat(n, C5) = ⌈10(n − 1)/7⌉ − 1 for 11 ≤ n ≤ 14, or n = 16, 18, 20, and is ⌈10(n − 1)/7⌉ for all other n ≥ 5, and we also prove that the only C5-saturated graphs w...

A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet a third approach, which is finitary but retains the semantic flavor of the model-theoretic version.

Observations of the hot gas surrounding Sgr A* and a few other nearby galactic nuclei imply electron and proton mean free paths comparable to the gas capture radius: hot accretion likely proceeds under weakly-collisional conditions in these systems. As a result, thermal conduction, rather than convection, may be important on all scales and affect the global flow properties. The self-similar ADA...