Structure of 18-cyanoprogesterone,C22H29O2N

The crystal structure of 18-cyanoprogesterone was determined by X-ray diffraction methods:P2₁2₁2₁ a=7.436(2),b=11.322(2),c=22.642(2) Å. The structure was solved usingShelx-86. Final conventionalR=0.054.R _w =0.051 for 1841 reflections. TheA ring has an intermediate sofa-half-chair conformation with asymmetry parameters C _s ^/1 =11.0, C ₂ ^3,4 =14.9. The steroid skeleton exhibits a flattening of theA ring relative to the rest of the molecule. The progesterone side chain has a typical conformation, and the C16-C17-C20-O20 torsion angle is –19.0(6)°.     

In-trees and plane embeddings of outerplanar graphs

A notion of anin-tree is introduced. It is then used to characterize and count plane embeddings of outerplanar graphs. In-trees have also been applied in the study of independent vertex covers of faces in outerplanar graphs.This research was partially supported by the grant RP.I.09, from the Institute of Informatics, University of Warsaw. Hospitality of the Institute of Datalogy, University of Copenhagen where this research has been completed is gratefully acknowledged.     

The complexity of many cells in arrangements of planes and related problems

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m ^2/3 n logn +n ²); we can calculatem such cells specified by a point in each, in worst-case timeO(m ^2/3 n log³ n+n ² logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m ^2/3 n logn+n ²), but this number is onlyO(m ^3/5– n ^4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m ^3/4– n ^3/4+3 +m) log² n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m ^3/4– n ^3/4+3 +m] log² n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m ^2/3 n ^d/3 logn+n ^d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147.     

Implicitly representing arrangements of lines or segments

Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n ²) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space¹ and (n ^3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n ^1/3)+O(K) time, given(n ^4/3) space and (n ^5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m ^2/3 n ^2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.     

The dynamics of multidimensional cosmological models in the presence of quantum effects. I. The case FRW ×T D at high temperatures

The dynamical system approach is applied to the study of dynamics of multidimensional cosmological models with topology FRW ×T ^D (D-dimensional torus) in the presence of high-temperature quantum effects. The stability methods developed in the paper of Szydowski (Gen. Rel. Grav.,20, 221, 1988) are used in the analysis of typical states of the metric in the neighborhood of singularities and for large time values. The problems of dynamical dimensional reduction, structure of singularities, isotropization, etc., are discussed in this context.     

On an application of Hall's representatives theorem to a finite geometry problem

It is well-known thatn points not belonging to a hyperplane determine at leastn hyperplanes. The possible configurations of hyperplanes in the case when the number of hyperplanes is equal ton are known, too. In this paper we obtain these results by means of Hall's representatives theorem. The setting is that of a finite geometry.     

Phase space dependence of the multiplicity distribution in π+ andpp collisions at 250 GeV/c

The charged particle multiplicity distribution has been studied for non-single-diffractive π⁺ p andpp collisions at \(\sqrt s = 22\) GeV, for full phase space as well as for intervals in rapidity, azimuthal angle and transverse momentum. In general, the multiplicity distribution is well described by a negative binomial. From comparison of the distribution for negative or positive particles to that of all charged particles, cascading is favoured as an interpretation over stimulated emission. Interesting consequences follow from a comparison of our results to those at collider energies and toe ⁺ e ^? data at comparable energy. Furthermore, evidence is given that the multiplicity distribution is not exactly of negative binomial type in every (connected or disconnected) phase space region.     

Forward-backward multiplicity correlations in σ+ p,K + p andpp collisions at 250 GeV/c

Forward-backward multiplicity correlations in σ⁺,K ⁺ p andpp collisions at 250 GeV/c ( \(\sqrt s \) =22 GeV) are given for all charges and for the different charge combinations. The correlations are found to be caused predominantly by centrally produced particles. It is demonstrated that this result is an agreement with observations at the ISR and the CERNp \(\bar p\) -Collider. The results are compared to expectations from LUND, DPM and FRITIOF Monte Carlo models and a geometrical picture relating correlations in hadron-hadron collisions toe ⁺ e ^? data in terms of impact parameters is tested.     

The group of local biholomorphisms of ℂ1 and conformal field theory in the operator formalism

Motivated by the operator formulation of conformal field theory on Riemann surfaces, we study the properties of the infinite dimensional group of local biholomorphic transformations (conformal reparametrizations) of ¹ and develop elements of its representation theory.     

A model of adsorption at liquid-solid interface involving association in the bulk phase

A model of monolayer adsorption of binary liquid mixtures on homogeneous and heterogeneous solid surfaces involving association of one component in the bulk phase is discussed. Suitable model calculations, illustrating association and heterogeneity effects, have been performed according to an equation derived for adsorption excess. This equation has been examined by using the experimental data of adsorption of alcohols from benzene andn-heptane on silica gel.

---

Adsorptionsmodell für die Grenzfläche Feststoff-Flüssigkeit unter Berücksichtigung der Assoziation in der Flüssigkeitsphase

Zusammenfassung Es wird ein Adsorptionsmodell binärer, flüssiger Mischungen an homogenen und heterogenen Oberflächen von Feststoffen unter Beachtung der Assoziation eines der Bestandteile in der Flüssigkeitsphase diskutiert. Mit der aus dem Oberflächenüberschuß abgeleiteten Gleichung wurden entsprechende Modellberechnungen durchgeführt, die die mit Assoziation und Heterogenität verbundenen Effekte illustrieren. Die Gleichung wurde für die experimentellen Daten der Alkoholadsorption aus Benzol undn-Heptan an Kieselgel überprüft.