The Effect of the Spacer of Bis(biurea) Ligands on the Structure of A2L3‐type (A=anion) Phosphate Complexes

By tuning the length and rigidity of the spacer of bis(biurea) ligands L, three structural motifs of the A₂L₃ complexes (A represents anion, here orthophosphate PO₄^3?), namely helicate, mesocate, and mono‐bridged motif, have been assembled by coordination of the ligand to phosphate anion. Crystal structure analysis indicated that in the three complexes, each of the phosphate ions is coordinated by twelve hydrogen bonds from six surrounding urea groups. The anion coordination properties in solution have also been studied. The results further demonstrate the coordination behavior of phosphate ion, which shows strong tendency for coordination saturation and geometrical preference, thus allowing for the assembly of novel anion coordination‐based structures as in transition‐metal complexes.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

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.     

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.     

On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.