Composition and properties of freeze-dried products of nicotinic acid withβ-cyclodextrin and heptakis (2,6-0-dimethyl)-β-cyclodextrin

The purpose of the study was to examine the formation of inclusion compounds in the freeze-dried products obtained from aqueous solutions of nicotinic acid and -cyclodextrin (-CD), or heptakis (2,6-0-dimethyl)--cyclodextrin (DIMEB). The molar ratios used were 1:1 and 2:1. In addition two freezing temperatures (–40 and –196°C) and different secondary drying temperatures (+50 and +80°C) were used. Freeze-dried products with -CD obtained after low temperature freezing are of the same crystallographic structure as seen in a pure inclusion compound prepared by coprecipitation. Amorphous products were formed after fast freezing. The molar ratios of included nicotinic acid in the freeze-dried products vary — dependent on the preparation conditions — between 0.75:1 and 1:1. A factorial design proves that the included drug amount can be increased by enhancement of the amount of nicotinic acid used, by faster freezing, and by the combination of these two factors. The proof of inclusion formation was given by a combination of X-ray diffractography, differential scanning calorimetry, thermogravimetry and thermofractography.The freeze-dried preparations obtained with DIMEB were amorphous mixtures of the two components. No proof for inclusion of the nicotinic acid in the cyclodextrin cavity could be given. Higher (–40°C) or lower (–196°C) freezing temperatures and the running of the secondary drying process could not influence these results. The very low stability constant of the complex and steric reasons are responsible for this behavior.     

Perturbation analysis of the orthogonal procrustes problem

Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm MA – B is minimized. This paper treats the common case when the orthogonal matrixM is required to have a positive determinant. The stability of the problem is studied and supremum results for the perturbation bounds are derived.     

Convexity theories III. Classification of certain real convexity theories

In this paper we classify all real convexity theories that contain the standard convexity theory _c. For this purpose we consider three subcases: finitary; infinitary and (_sc\_c)Ø; infinitary and _sc=_c. In each of these subcases one encounters a phenomenon resembling bifurcation.This research was supported by the Deutsche Forschungsgemeinschaft.     

Zur krümmungsverwandtschaft von zwangläufen in affinen ck — Ebenen II

In part I we have studied a map of osculating elements of an affine Cayley-Klein (CK-) plane into the Lie algebra A₄(²) of the aequiform transformations A₄(²) of the given plane A₂(, ²). If we use the real projective space P₃() over A₄(²) each osculating element defines a straight line in P₃(). We now give a one parameter motion in A₄(²) and study second order properties and their analogon in the Lie algebra and P₃(), respectively. We show that the wellknown relationship between the points of the moving frame and the osculating circles of the point paths in the fixed frame may be interpreted as part of a quadratic map of certain straight Lines of P₃(). An analogous result holds for the curvature of pairs of envelopes; the mapV induced in P₃() than is contained in a cubic relationship of straight lines.

---

---

Herrn Professor Oswal Giering zum 60. Geburtstag gewidmet     

On the complexity of the disjoint paths problem

In this paper we consider the disjoint paths problem. Given a graphG and a subsetS of the edge-set ofG the problem is to decide whether there exists a family of disjoint circuits inG each containing exactly one edge ofS such that every edge inS belongs to a circuit inC. By a well-known theorem of P. Seymour the edge-disjoint paths problem is polynomially solvable for Eulerian planar graphsG. We show that (assumingPNP) one can drop neither planarity nor the Eulerian condition onG without losing polynomial time solvability. We prove theNP-completeness of the planar edge-disjoint paths problem by showing theNP-completeness of the vertex disjoint paths problem for planar graphs with maximum vertex-degree three. This disproves (assumingPNP) a conjecture of A. Schrijver concerning the existence of a polynomial time algorithm for the planar vertex-disjoint paths problem. Furthermore we present a counterexample to a conjecture of A. Frank. This conjecture would have implied a polynomial algorithm for the planar edge-disjoint paths problem. Moreover we derive a complete characterization of all minorclosed classes of graphs for which the disjoint paths problem is polynomially solvable. Finally we show theNP-completeness of the half-integral relaxation of the edge-disjoint paths problem. This implies an answer to the long-standing question whether the edge-disjoint paths problem is polynomially solvable for Eulerian graphs.Supported by Sonderforschungsbereich 303 (DFG)     

Homomorphisms onC ∞ (E) andC ∞-bounding sets

We prove, for the class of real locally convex spacesE that are continuously and linearly injectable into somec ₀(), that every non-zero homomorphism on the algebraC (E) ofC -functions onE is given by a point evaluation at some point ofE. Furthermore, if every real-valuedC -function on the weak topology of a quasi-complete locally convex spaceE is bounded on a subsetA ofE, thenA is relatively weakly compact.     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.     

Asymptotic expansions in the integral and local limit theorems in banach spaces with applications to ω-statistics

LetB be a real separable Banach space and letX,X ₁,X ₂,...∈B denote a sequence of independent identically distributed random variables taking values inB. DenoteS _n =n ^?1/2(X ₁+...X _n ). Let π:B→R be a polynomial. We consider (truncated) Edgeworth expansions and other asymptotic expansions for the distribution function of the r.v. π(S _n ) with uniform and nonuniform bounds for the remainder terms. Expansions for the density of π(S _n ) and its higher order derivatives are derived as well. As an application of the general results we get expansions in the integral and local limit theorems for ω-statistics $$\omega _n^p (q)\mathop { = n^{{p \mathord{\left/ {\vphantom {p 2}} \right. \kern-\nulldelimiterspace} 2}} }\limits^\Delta \smallint _{(0,1)} \{ F_n (x) - x\} ^p q(x)dx$$ and investigate smoothness properties of their distribution functions. Herep≥2 is an even number,q: [0, 1]→[0, ∞] is a measurable weight function, andF _n denotes the empirical distribution function. Roughly speaking, we show that in order to get an asymptotic expansion with remainder termO(n ^?α), α<p/2, for the distribution function of the ω-statistic, it is sufficient thatq is nontrivial, i.e., mes{t∈(0, 1):q(t)≠0}>0. Expansions of arbitrary length are available provided the weight functionq is absolutely continuous and positive on an nonempty subinterval of (0, 1). Similar results hold for the density of the distribution function and its derivatives providedq satisfies certain very mild smoothness condition and is bounded away from zero. The last condition is essential since the distribution function of the ω-statistic has no density whenq is vanishing on an nonempty subinterval of (0, 1).     

Chern-Simons theory with finite gauge group

We construct in detail a 2+1 dimensional gauge field theory with finite gauge group. In this case the path integral reduces to a finite sum, so there are no analytic problems with the quantization. The theory was originally introduced by Dijkgraaf and Witten without details. The point of working it out carefully is to focus on the algebraic structure, and particularly the construction of quantum Hilbert spaces on closed surfaces by cutting and pasting. This includes the Verlinde formula. The careful development may serve as a model for dealing with similar issues in more complicated cases.The first author is supported by NSF grant DMS-8805684, an Alfred P. Sloan Research Fellowship, a Presidential Young Investigators award, and by the O'Donnell Foundation. The second author is supported by NSF grant DMS-9207973     

Computer controlled spreading resistance system for measurement of carrier concentration profiles of silicon structures

A new computer controlled equipment for carrier concentration profile determination of silicon structures by a spreading resistance technique is presented. The required data and plots can easily be obtained by means of a new software package, which has been specially developed for this purpose. Measurements have been performed on different structures in order to verify the suitability of both the measuring system and the software package. The reproducibility has been found to be within 5% for the investigated structures.