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.     

The many facets of linear programming

We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods. Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001     

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.     

Coboundaries of irreducible markov operators onC(K)

LetK be a compact Hausdorff space, and letT be an irreducible Markov operator onC(K). We show that ifgεC(K) satisfies sup _N ‖Σ _j ^=0N T ^j g‖<∞, then (and only then) there existsfεC(K) with (I − T)f=g. Generalizing the result to irreducible Markov operator representations of certain semi-groups, we obtain that bounded cocycles are (continuous) coboundaries. For minimal semi-group actions inC(K), no restriction on the semi-group is needed.     

Some Fixed-Point Results for the Dynamic Assignment Problem

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm.