Parameterization of all solutions of the three chains completion problem

The family of all solutions of the three chains completion problem with a prescribed tolerance is described explicitly. It is shown that this family can be parameterized by a natural set of contractive upper triangular operators. As an application all solutions to a suboptimal nonstationary Nehari problem are described.     

The synthesis,characterization, and weathering behavior of polycarbonates derived from bis(P-hydroxyphenyl) dimethylsilane (BPSI)

Polycarbonates and copolycarbonates based on BPSi and BPA were easily made using the standard interfacial technique. Molecular weight and NMR data indicate that up to 4 mol % of the BPSi decomposes during polymerization via a base-catalyzed rearrangement of BPSi to arylsiloxanes. Oxygen index studies show an increased flame resistance with increasing BPSi monomer content. DSC measurements show a decrease in glass transition with BPSi monomer concentration while TGA shows an increase in char residue with BPSi monomer content. In addition, TGA indicates no change in either thermal or thermooxidative stability with the relative BPSi/BPA concentrations. Outdoor weathering of BPSi PC and BPA PC films indicates that BPSi PC is ca. 5 times more weathering resistant than BPA PC. This latter result can be attributed to a combination of BPSi PC's lower UV absorptivity, higher water repellency, and lower likelihood for side chain photooxidation. © 1993 John Wiley & Sons, Inc.     

Lifetime study of high-spin states in 104,105In

In the neutron deficient isotopes _104,105In lifetimes of high spin states in the range from 0.5 ps to 600 ps have been measured in a coincidence recoil distance Doppler shift (RDDS) experiment. By combining the Doppler shift attenuation (DSA) and RDDS methods at few μm flight distances, the problem of delayed feeding has been avoided and very short lifetimes in the range 0.5–0.8 ps have been determined. Shell model calculations with strong restrictions for the neutron orbitals reveal good agreement with experimental level energies and still fair agreement for most measured B(M1) and B(E2) values. Received: 30 June 1998     

Nonstationary curves in Hilbert spaces and their correlation functions II

Partially supportted by Grant MM-22/1991 of MESC     

Cores and retracts

Theretracts (idempotent, isotone self-maps) of an ordered set are naturally ordered as functions. In this note we characterize the possible ways that one retract can cover another one. This gives some insight into the structure of the ordered set of retracts and leads to a natural generalization of the core of an ordered set.Supported by NSERC Operating Grant 41702.     

四溴双酚A锑铝双金属化合物的合成及其阻燃性能

以四溴双酚Ａ（ＴＢＡ）合成了在水和空气中稳定的四溴双酚Ａ合锑铝双金属化合物（ＴＢＡＳＡ）．通过ＩＲ、１ＨＮＭＲ和元素分析予以表征，并研究了其对聚乙烯（ＰＥ）和聚环氧乙烷（ＰＥＯ）的阻燃性能．结果表明，这种分子中含有溴、锑和铝的化合物，对聚乙烯和聚环氧乙烷等高聚物材料有高的阻燃性能与消烟效果．     

The σ<Emphasis Type="Italic">g</Emphasis>-Drazin Inverse and the Generalized Mbekhta Decomposition

In this paper we define and study an extension of the g-Drazin for elements of a Banach algebra and for bounded linear operators based on an isolated spectral set rather than on an isolated spectral point. We investigate salient properties of the new inverse and its continuity, and illustrate its usefulness with an application to differential equations. Generalized Mbekhta subspaces are introduced and the corresponding extended Mbekhta decomposition gives a characterization of circularly isolated spectral sets.     

Entropy estimate for high-dimensional monotonic functions

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L^p norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density.     

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.