Influence functions and efficiencies of the canonical correlation and vector estimates based on scatter and shape matrices

In this paper, the influence functions and limiting distributions of the canonical correlations and coefficients based on affine equivariant scatter matrices are developed for elliptically symmetric distributions. General formulas for limiting variances and covariances of the canonical correlations and canonical vectors based on scatter matrices are obtained. Also the use of the so-called shape matrices in canonical analysis is investigated. The scatter and shape matrices based on the affine equivariant Sign Covariance Matrix as well as the Tyler's shape matrix serve as examples. Their finite sample and limiting efficiencies are compared to those of the Minimum Covariance Determinant estimators and S-estimator through theoretical and simulation studies. The theory is illustrated by an example.     

A nilpotent Roth theorem

Let T and S be invertible measure preserving transformations of a probability measure space (X, ℬ, μ). We prove that if the group generated by T and S is nilpotent, then exists in L ²-norm for any u, v∈L ^∞(X, ℬ, μ). We also show that for A∈ℬ with μ(A)>0 one has . By the way of contrast, we bring examples showing that if measure preserving transformations T, S generate a solvable group, then (i) the above limits do not have to exist; (ii) the double recurrence property fails, that is, for some A∈ℬ, μ(A)>0, one may have μ(A∩T _-n A∩S ^{- n} A)=0 for all n∈ℕ. Finally, we show that when T and S generate a nilpotent group of class ≤c, in L ²(X) for all u, v∈L ^∞(X) if and only if T×S is ergodic on X×X and the group generated by T ^-1 S, T ^-2 S ²,..., T ^-c S ^c acts ergodically on X. Oblatum 19-V-2000 & 5-VII-2001?Published online: 12 October 2001     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Spatial design matrices and associated quadratic forms: structure and properties

The paper provides significant simplifications and extensions of results obtained by Gorsich, Genton, and Strang (J. Multivariate Anal. 80 (2002) 138) on the structure of spatial design matrices. These are the matrices implicitly defined by quadratic forms that arise naturally in modelling intrinsically stationary and isotropic spatial processes. We give concise structural formulae for these matrices, and simple generating functions for them. The generating functions provide formulae for the cumulants of the quadratic forms of interest when the process is Gaussian, second-order stationary and isotropic. We use these to study the statistical properties of the associated quadratic forms, in particular those of the classical variogram estimator, under several assumptions about the actual variogram.     

Simultaneous Packing and Covering in the Euclidean Plane

 In this article we study the simultaneous packing and covering constants of two-dimensional centrally symmetric convex domains. Besides an identity result between translative case and lattice case and a general upper bound, exact values for some special domains are determined. Similar to Mahler and Reinhardt’s result about packing densities, we show that the simultaneous packing and covering constant of an octagon is larger than that of a circle. (Received 17 January 2001; in revised form 13 July 2001)     

EPR and XPS measurements of polymeric catalysts doped with hereopolyacids in oxygen adsorption studies

The goal of our studies was to determine the nature of interactions between catalytic active samples, such as polypyrrole (PPy) doped with: chloride anions, heteropolyacids such as H₅PMo₁₀V₂O₄₀, or H₄SiW₁₂O₄₀, and oxygen particles. In order to reveal the mechanism of the linkage between the catalysts and oxygen we provided the electron paramagnetic resonance (EPR) measurements of synthesized samples in O₂ and N₂ flow. Moreover, the X-ray photoelectron spectroscopy (XPS) measurements were performed to show the properties of doped heteropolyacids and the state of nitrogen in polypyrrole matrix. The results of EPR studies of PPy(Cl), PPy(H₄SiW₁₂O₄₀), PPy(H₅PMo₁₀V₂O₄₀) samples, show that the polypyrrole doped with chloride anions interacts much easier with oxygen than polypyrrole doped with heteropolyacids (in the above given order, of preference with the most active polypyrrole system first). It correlates with XPS results, which show that a molybdenium-vanadium anion is more reduced than a silicon-tungsten one. The redox reactions of heteropolyacids involve the oxidation-reduction of the conjugated polymer chain, leaving no or little place for interactions with oxygen. Polypyrrole doped with H₄SiW₁₂O₄₀ shows some oxygen sensitivity as observed in the EPR studies, as opposed to polypyrrole doped with H₅PMo₁₀V₂O₄₀, which is in line with the XPS results.     

Attractors for 2D-Navier-Stokes models with delays

The existence of an attractor for a 2D-Navier-Stokes system with delay is proved. The theory of pullback attractors is successfully applied to obtain the results since the abstract functional framework considered turns out to be nonautonomous. However, on some occasions, the attractors may attract not only in the pullback sense but in the forward one as well. Also, this formulation allows to treat, in a unified way, terms containing various classes of delay features (constant, variable, distributed delays, etc.). As a consequence, some results for the autonomous model are deduced as particular cases of our general formulation.