Every separable metric space is Lipschitz equivalent to a subset ofc 0 +

It is shown that there is a constantK so that, for every separable metric spaceX, there is a mapT:X →c _o satisfyingd(x, y)≦‖Tx−Ty‖≦Kd(x, y) for everyx, y ∈ X. This is a part of the author's Ph.D. Thesis prepared at the Hebrew University of Jerusalem, under the supervision of Professor J. Lindenstrauss.     

Atmospharische Luft

Ohne Zusammenfassung     

Die colorimetrische Bestimmung des Calciums mit Ammoniumpurpurat

Ohne Zusammenfassung     

The Electronic State of Flavoproteins: Investigations with Proton Electron–Nuclear Double Resonance

Electron–nuclear double resonance (ENDOR) spectroscopy provides useful information on hyperfine interactions between nuclear magnetic moments and the magnetic moment of an unpaired electron spin. Because the hyperfine coupling constant reacts quite sensitively to polarity changes in the direct vicinity of the nucleus under consideration, ENDOR spectroscopy can be favorably used for the detection of subtle protein–cofactor interactions. A number of pulsed ENDOR studies on flavoproteins have been published during the past few years; most of them were designed to characterize the flavin cofactor by means of its protonation state, or to detect individual protein–cofactor interactions. The aim of this study is to compare the pulsed ENDOR spectra from different flavoproteins in terms of variations of characteristic proton hyperfine values. The general concept is to observe limits of possible influences on the cofactor’s electronic state by surrounding amino acids. Furthermore, we compare ENDOR data obtained from in vivo experiments with in vitro data to emphasize the potential of the method for gaining molecular information in complex media.     

Numerical Computation of Galois Groups

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. We give numerical methods to compute the Galois group and study it when it is not the full symmetric group. One algorithm computes generators, while the other studies its structure as a permutation group. We illustrate these algorithms with examples using a Macaulay2 package we are developing that relies upon Bertini to perform monodromy computations.     

<Emphasis Type="Italic">L</Emphasis>Σ(≤ <Emphasis Type="Italic">ω</Emphasis>)-spaces and spaces of continuous functions

We present a few results and problems related to spaces of continuous functions with the topology of pointwise convergence and the classes of LΣ(≤ ω)-spaces; in particular, we prove that every Gul’ko compact space of cardinality less or equal to $ \mathfrak{c} $ \mathfrak{c} is an LΣ(≤ ω)-space.