Filters compatible with isomorphism testing

Like the lower central series of a nilpotent group, filters generalize the connection between nilpotent groups and graded Lie rings. However, unlike the case with the lower central series, the associated graded Lie ring may share few features with the original group: e.g. the associated Lie ring can be trivial or arbitrarily large. We determine properties of filters such that every isomorphism between groups is induced by an isomorphism between graded Lie rings.     

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     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

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     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

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.     

一种新型可调谐锁模光纤激光器

利用法布里-珀罗腔的激光二极管作为调制器件，实现环形腔光纤激光器的主动锁模。并利用法布里-珀罗腔的激光二极管的多纵模特性，把激光二极管当作一梳状滤波器，通过偏振控制器来调整入射到激光二极管内光的偏振态，同时均衡腔内增益，得到波长大范围可调谐的锁模激光，其脉冲宽度约为48ps，脉冲重复速率2GHz。