Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

Stability testing in an integrated scheme

ISO Guide 35 deals with RM stability issues and scrutinizes the evaluation of stability testing results under the assumption that either there is no trend at all (a rather rare situation), or any observed deterministic change is insignificant and thus can be neglected. However, market demands for reliable reference materials are obviously not limited to stable or at least seemingly stable materials. In many analytical applications, analytes and measurands under consideration are known, or at least suspected, to be unstable on time scales that may vary widely from measurand to measurand. The Federal Institute for Materials Research and Testing (BAM) has developed (and successfully uses) an integrated approach in its certification practice. The approach is based on an initial stability study and subsequent post-certification monitoring. Data evaluation is model-based and takes advantage of all information collected in the stability testing scheme(s). It thus allows one to deal with any kind of instability observed, to assess limiting time intervals at any stress condition in the range tested, to estimate a final expiry date for materials with detected instabilities or the maximum admissible re-testing interval for seemingly stable materials, and to assess maximum admissible stress loads during delivery of the material to the customer. The article describes (and exemplifies) typical study layout, the model selection, and the integrated data assessment.     

Characterization of low molecular weight hydrocarbon oligomers by laser desorption/ionization time-of-flight mass spectrometry using a solvent-free sample preparation method.

A new solvent-free sample preparation method using silver trifluoroacetate (AgTFA) was developed for the analysis of low molecular weight paraffins and microcrystalline waxes by laser desorption/ionization time-of-flight mass spectrometry (LDI-TOFMS). Experiments show that spectral quality can be enhanced by dispersing AgTFA directly in liquid paraffins without the use of additional solvents. This preparation mixture is applied directly to the MALDI probe. Solid waxes could be examined by melting prior to analysis. The method also provides sufficiently reproducible spectra that peak area ratios between mono- and bicyclic alkane peaks indicated variations in the cycloalkane content of paraffin samples. Dehydrogenation of hydrocarbons observed during the desorption/ionization process was studied by analysis of alkane standards.     

Uniform bounds under increment conditions

We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

     

Pion correlations and resonance effects in \bar{p}p annihilation to 4\pi^0 at rest

We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while the stochastic HBT mechanism is not supported by the present findings. Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002     

Almost Sure Convergence and Square Functions of Averages Of Riemann Sums

Under a very moderate assumption on the Fourier coefficients of a periodic function, we show the convergence almost everywhere of the sequence of averages of its associated Riemann sums. The structure of the set of averages is analyzed by proving a spectral regularization type inequality, which allows to control the corresponding Littlewood-Paley square function.     

Metallo‐supramolecular block copolymer micelles: Improved preparation and characterization

Micelles prepared from amphiphilic block copolymers in which a poly(styrene) segment is connected to a poly(ethylene oxide) block via a bis‐(2,2′:6′,2″‐terpyridine‐ruthenium) complex have been intensely studied. In most cases, the micelle populations were found to be strongly heterogeneous in size because of massive micelle/micelle aggregation. In the study reported in this article we tried to improve the homogeneity of the micelle population. The variant preparation procedure developed, which is described here, was used to prepare two “protomer”‐type micelles: PS₂₀‐[Ru]‐PEO₇₀ and PS₂₀‐[Ru]‐PEO₃₇₅. The dropwise addition of water to a solution of the compounds in dimethylformamide was replaced by the controlled addition of water by a syringe pump. The resulting micelles were characterized by sedimentation velocity and sedimentation equilibrium analyses in an analytical ultracentrifuge and by transmission electron microscopy of negatively stained samples. Sedimentation analysis showed virtually unimodal size distributions, in contrast to the findings on micelles prepared previously. PS₂₀‐[Ru]‐PEO₇₀ micelles were found to have an average molar mass of 318,000 g/mol (corresponding to 53 protomers per micelle, which is distinctly less than after micelle preparation by the standard method) and an average hydrodynamic diameter (d_h) of 18 nm. For PS₂₀‐[Ru]‐PEO₃₇₅ micelles, the corresponding values were M = 603,000 g/mol (31 protomers per micelle) and d_h = 34 nm. The latter particles were found to be identical to the “equilibrium” micelles prepared in pure water. Both micelle types had a very narrow molar mass distribution but a much broader distribution of s values and thus of hydrodynamic diameters. This indicates a conformational heterogeneity that is stable on the time scale of sedimentation velocity analysis. The findings from electron microscopy were in disagreement with those from the sedimentation analysis both in average micelle diameter and in the width of the distributions, apparently because of imperfections in the staining procedure. The preparation procedure described also may be useful in micelle formation from other types of protomers. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4458–4465, 2004     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.