SOLUTIONS OF THE EQUATION x^m＋y^m=z^m IN SL2z

This paper solves an open problem of Vaserstein. The main result is: the equation x^m y^m=z^m has a solution in SL2z if and only if m is not divisible by 4 or 6 and m is not congruent to 3 modulo 6.     

Hybrid organosilazane/organosilylamine telechelic oligomers—I. Two-dimensional NMR spectroscopy characterization of dimethylsilylethylenediamine oligomers

The detailed characterization of multifunctional hybrid organosilazane/organosilylamine telechelic oligomers by IR and ¹H, ¹³C and ²⁹Si NMR spectroscopy in one and two dimenions has been undertaken. The specific multifunctional oligomers, comprising NH/NH₂ or SiCl functionalities depending on the monomer feed-ratio, were prepared from mono- and di-functionally reacted dichlorodimethylsilane (DDS) and mono-, di-, tri- and tetra-functionally reacted ethylenediamine (EDA). Varying the feed-ratio afforded control of the microstructures of the oligomers and the preparation of oligomers with, in some cases, conterminously located silicon–chlorine (SiCl) groups. The combination of the NMR methods with the IR technique has enabled the detailed microstructural characterization of the oligomers and the identification of the functionalities therein. This approach and the knowledge gained from the DDS/EDA system has been applied to the microstructural characterization of other hybrid organosilazane/silylamine preceramic telechelic oligomers.     

Riccati-based preconditioner for computing invariant subspaces of large matrices

Summary. This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported. Received June 15, 2000 / Revised version received January 22, 2001 / Published online October 17, 2001     

Coupling for Markov renewal processes and the rate of convergence in ergodic theorems for processes with semi-Markov switchings

Coupling procedures for Markov renewal processes are described. Applications to ergodic theorems for processes with semi-Markov switchings are considered.This paper was partly prepared with the support of NFR Grant F-UP 10257-300.     

Asymptotics in the random assignment problem

Summary We show that, in the usual probabilistic model for the random assignment problem, the optimal cost tends to a limit constant in probability and in expectation. The method involves construction of an infinite limit structure, in terms of which the limit constant is defined. But we cannot improve on the known numerical bounds for the limit.Research supported by NSF Grant MCS90-01710     

Flips and the Hilbert scheme over an exterior algebra

We study the tangent space at a monomial point M in the Hilbert scheme that parameterizes all ideals with the same Hilbert function as M over an exterior algebra.     

An algorithm for computing Jordan chains and inverting analytic matrix functions

We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)⁻¹b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic.     

Remarks on a theorem of Taskinen on spaces of continuous functions

We clarify and prove in a simpler way a result of Taskinen about symmetric operators on C(Kⁿ), K an uncountable metrizable compact space. To do this we prove that, for any compact space K and any n ∈ ?, the symmetric injective n–tensor product of C(K), , is complemented in C(B_C(K)*), a result of independent interest. The techniques we develop allow us to extend the result in several directions. We also show that the hypothesis of metrizability and uncountability cannot be removed.     

Banach-stone theorems and separating maps

LetC(X,E) andC(Y,F) denote the spaces of continuous functions on the Tihonov spacesX andY, taking values in the Banach spacesE andF, respectively. A linear mapH:C(X,E)→C(Y,F) isseparating iff(x)g(x)=0 for allx inX impliesHf(y)Hg(y)=0 for ally inY. Some automatic continuity properties and Banach-Stone type theorems (i.e., asserting that isometries must be of a certain form) for separating mapsH between spaces of real- and complex-valued functions have already been developed. The extension of such results to spaces of vector-valued functions is the general subject of this paper. We prove in Theorem 4.1, for example, for compactX andY, that a linear isometryH betweenC(X,E) andC(Y,F) is a “Banach-Stone” map if and only ifH is “biseparating (i.e,H andH ⁻¹ are separating). The Banach-Stone theorems of Jerison and Lau for vector-valued functions are then deduced in Corollaries 4.3 and 4.4 for the cases whenE andF or their topological duals, respectively, are strictly convex. Research supported by the Fundació Caixa Castelló, MI/25.043/92     

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

In this paper we design a fast new algorithm for reducing an N × N quasiseparable matrix to upper Hessenberg form via a sequence of N − 2 unitary transformations. The new reduction is especially useful when it is followed by the QR algorithm to obtain a complete set of eigenvalues of the original matrix. In particular, it is shown that in a number of cases some recently devised fast adaptations of the QR method for quasiseparable matrices can benefit from using the proposed reduction as a preprocessing step, yielding lower cost and a simplification of implementation.