von Neumann’s trace inequality for Hilbert–Schmidt operators

von Neumann’s inequality in matrix theory refers to the fact that the Frobenius scalar product of two matrices is less than or equal to the scalar product of the respective singular values. Moreover, equality can only happen if the two matrices share a joint set of singular vectors, and this latter part is hard to find in the literature. We extend these facts to the separable Hilbert space setting, and provide a self-contained proof of the “latter part”.     

PTML modeling for peptide discovery: in silico design of non-hemolytic peptides with antihypertensive activity

Molecular Diversity - Hypertension is a medical condition that affects millions of people worldwide. Despite the high efficacy of the current antihypertensive drugs, they are associated with...     

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.

     

Fast and efficient preparation of Baylis-Hillman-derived (E)-allylic azides and related compounds in aqueous medium

A practical access to alkyl- and aryl-substituted (E)-2-(azidomethyl)alkenoates and related azido compounds from the corresponding allylic bromides in aqueous acetone is described. An alternative method to obtain the starting bromides based on heterogeneous catalysis under mild conditions was also investigated.     

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.     

The boundary trace and generalized boundary value problem for semilinear elliptic equations with coercive absorption

In the first part of the paper we establish the existence of a boundary trace for positive solutions of the equation ?Δu + g(x, u) = 0 in a smooth domain Ω ? ?^N, for a general class of positive nonlinearities. This class includes every space independent, monotone increasing g which satisfies the Keller‐Osserman condition as well as degenerate nonlinearities g_α,q of the form g_α,q (x, u) = d(x, ?Ω)^α |u|^q?1 u, with α > ?2 and q > 1. The boundary trace is given by a positive regular Borel measure which may blow up on compact sets. In the second part we concentrate on the family of nonlinearities {g_α,q}, determine the critical value of the exponent q (for fixed α > ?2) and discuss (a) positive solutions with an isolated singularity, for subcritical nonlinearities and (b) the boundary value problem for ?Δu + g_α,q (x, u) = 0 with boundary data given by a positive regular Borel measure (possibly unbounded). We show that, in the subcritical case, the problem possesses a unique solution for every such measure. © 2003 Wiley Periodicals, Inc.     

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.